We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
2 parents 9265eba + c1b704d commit 4118b8dCopy full SHA for 4118b8d
Convex Hull/README.md
@@ -17,7 +17,7 @@ The quickhull algorithm works as follows:
17
- Keep on doing so on until no more points are left, the recursion has come to an end and the points selected constitute the convex hull.
18
19
20
-Our functioni will have the following defininition:
+Our function will have the following defininition:
21
22
`findHull(points: [CGPoint], p1: CGPoint, p2: CGPoint)`
23
0 commit comments