backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-02-03 10:35:34 +08:00
Code Issues Projects Releases Wiki Activity

Update geometry/graham_scan_algorithm.cpp

Browse Source 
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Lajat5
2021-11-08 12:07:13 +05:30
committed by GitHub
parent 7ef02d1cdb
commit f7f735b64a
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
geometry/graham_scan_algorithm.cpp
View File

@@ -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
*