From bfe80a05c7bd00d812282a827261be35d93de748 Mon Sep 17 00:00:00 2001 From: Lajat5 <64376519+Lazeeez@users.noreply.github.com> Date: Mon, 8 Nov 2021 12:07:23 +0530 Subject: [PATCH] Update geometry/graham_scan_functions.hpp Co-authored-by: David Leal --- geometry/graham_scan_functions.hpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/geometry/graham_scan_functions.hpp b/geometry/graham_scan_functions.hpp index 96363ec46..a97b98493 100644 --- a/geometry/graham_scan_functions.hpp +++ b/geometry/graham_scan_functions.hpp @@ -10,7 +10,7 @@ * Euclidean space, or equivalently as the set of all convex combinations of * points in the subset. For a bounded subset of the plane, the convex hull may * be visualized as the shape enclosed by a rubber band stretched around the - *subset. + * subset. * * The worst case time complexity of Jarvis’s Algorithm is O(n^2). Using * Graham’s scan algorithm, we can find Convex Hull in O(nLogn) time.