Lecture 7 - Sorting Summary
- Merge Sort is very consistent. Its execution time is extremely
insensitive to the way values are arranged in the given list.
QuickSort is quite sensitive to this.
- With an array implementation, QuickSort is a little better than
Merge Sort. With a linked implementation, Merge Sort is better.
- For very short lists, use Insertion Sort.
- Radix Sort is the best for large linked lists with relatively