From fb1f3809da2dd01f8612540cb1d61ebd4a4e0335 Mon Sep 17 00:00:00 2001 From: Maxwell Aladago Date: Wed, 4 Sep 2019 13:41:56 -0400 Subject: [PATCH] changing typo --- divide_and_conquer/convex_hull.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/divide_and_conquer/convex_hull.py b/divide_and_conquer/convex_hull.py index 42219794aed1..a0c319e766da 100644 --- a/divide_and_conquer/convex_hull.py +++ b/divide_and_conquer/convex_hull.py @@ -7,7 +7,7 @@ Two algorithms have been implemented for the convex hull problem here. 1. A brute-force algorithm which runs in O(n^3) -2. A divide-and-conquer algorithm which runs in O(n^3) +2. A divide-and-conquer algorithm which runs in O(n log(n)) There are other several other algorithms for the convex hull problem which have not been implemented here, yet.