previous
|
start
|
next
Merge Sort Vs Selection Sort
Selection sort is an O(
n
2
) algorithm
Merge sort is an O(
n
log(
n
) ) algorithm
The
n
log(
n
) function grows much more slowly than
n
2
previous
|
start
|
next