From f7f735b64abbed47231ecb9f3fbf8319bdd4e799 Mon Sep 17 00:00:00 2001 From: Lajat5 <64376519+Lazeeez@users.noreply.github.com> Date: Mon, 8 Nov 2021 12:07:13 +0530 Subject: [PATCH] Update geometry/graham_scan_algorithm.cpp Co-authored-by: David Leal --- geometry/graham_scan_algorithm.cpp | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/geometry/graham_scan_algorithm.cpp b/geometry/graham_scan_algorithm.cpp index 093099dea..730f5013a 100644 --- a/geometry/graham_scan_algorithm.cpp +++ b/geometry/graham_scan_algorithm.cpp @@ -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 *