Add big O notations of the time complexity of the Quick sort algorithm, with 1 notation per line

samuelselasi · samuelselasi · commit 188e2feb927e · 2023-04-22T00:57:00.000Z
diff --git a/3-O b/3-O
@@ -0,0 +1,3 @@
+O(nlog(n))
+O(nlog(n))
+O(n^2)
