previous |
start |
next
Analyzing the Merge Sort Algorithm
- Despite appearing to be a much more complicated
algorithm, merge sort performs much better than selection
sort.
- Note that the graph does not have a parabolic
shape; instead it appears as if running time grows approximately
linearly with the size of the array.
previous |
start |
next