0
Comparisons
0
Swaps
Merge Sort
A specific type of divide-and-conquer algorithm that divides the input array into two halves, calls itself for the two halves, and then merges the two sorted halves.
Time ComplexityO(n log n)
Space ComplexityO(n)
A specific type of divide-and-conquer algorithm that divides the input array into two halves, calls itself for the two halves, and then merges the two sorted halves.