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
  *