You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+2-4Lines changed: 2 additions & 4 deletions
Original file line number
Diff line number
Diff line change
@@ -43,8 +43,7 @@ Selection sort is noted for its simplicity, and it has performance advantages ov
43
43
44
44
## Merge Sort
45
45
Merge Sort is a Divide and Conquer algorithm that continually splits a list in half and then merge the sublists in a sorted way.
46
-
A single most important advantage of merge sort over quick sort
47
-
is its stability: the elements compared equal retain their original order.
46
+
A single most important advantage of merge sort over quick sort is its stability: the elements compared equal retain their original order.
48
47
49
48
50
49
| Case | Performance |
@@ -59,8 +58,7 @@ is its stability: the elements compared equal retain their original order.
59
58
60
59
## Quick sort
61
60
62
-
Quick Sort is a recursive sorting algorithm that is more effective than other Θ(nlogn) algorithms for datasets that fit in memory, but is unstable.
63
-
Quick Sort in general does not requiere extra space while Merge Sort requires O(N) extra storage
61
+
Quick Sort is a recursive sorting algorithm that is more effective than other Θ(nlogn) algorithms for datasets that fit in memory, but is unstable. Quick Sort in general does not requiere extra space while Merge Sort requires O(N) extra storage
0 commit comments