Skip to content

Commit a007e21

Browse files
FaroukOyekunleFaroukOyekunle
committed
Write in the file 103-O, the big O notations of the time complexity of the Merge sort algorithm, with 1 notation per line: in the best case, in the average case, in the worst case.
1 parent 70905a3 commit a007e21

File tree

1 file changed

+3
-0
lines changed

1 file changed

+3
-0
lines changed

‎103-O‎

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,3 @@
1+
O(nlog(n))
2+
O(nlog(n))
3+
O(nlog(n))

0 commit comments

Comments
 (0)