11. The classic example of recursion is in list-sorting algorithms such as Merge Sort . 12. But, hey, I'm a discuss and merge sort of guy anyway. 13. For instance, I've used a truncated merge sort for sorting student assignments. 14. Merge sort is good for that.15. In the bottom up merge sort , the starting point assumes each run is one item long. 16. Quicksort has some disadvantages when compared to alternative sorting algorithms, like merge sort , which complicate its efficient parallelization. 17. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort . 18. A tape-drive implementation of the polyphase merge sort was described in " The Art of Computer Programming ". 19. In the typical case, the natural merge sort may not need as many passes because there are fewer runs to merge. 20. In the merge sort algorithm, this subroutine is typically used to merge two sub-arrays, of a single array.
