From 8577fcfe5bc466aab83387dcb9e79ea0990bc1c3 Mon Sep 17 00:00:00 2001 From: Lajat5 <64376519+Lazeeez@users.noreply.github.com> Date: Sun, 7 Nov 2021 23:57:52 +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 47c7851fc..96363ec46 100644 --- a/geometry/graham_scan_functions.hpp +++ b/geometry/graham_scan_functions.hpp @@ -13,7 +13,7 @@ *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. + * Graham’s scan algorithm, we can find Convex Hull in O(nLogn) time. * * ### Implementation *