Merge Sort
Iterative Java program (Bottom up)
Improvements
1. Use insertion sort for small subarrays : Mergesort has too much overhead for tiny subarrays. Cutoff to insertion sort for ≈ 7 items. Java program
2. Stop if already sorted : Is biggest item in first half ≤ smallest item in second half? Helps for partially-ordered arrays. Java program
3. Eliminate the copy to the auxiliary array : Save time (but not space) by switching the role of the input and auxiliary array in each recursive call. Java program
Comments
Post a Comment