Difference between revisions of "TADM2E 4.41"
From Algorithm Wiki
Revision as of 18:14, 11 September 2014
*Advantages: suitable for linked list, suitable for external sort. *Disadvantages: need extra buffer holding the merged data.
*Advantages: easy to implement. *Disadvantages: too slow and become impractical when data is huge.
*Advantages: don't need recursion. Suitable for large data. *Disadvantages: usually slower than merge sort and quick sort.
*Advantages: practical fastest. *Disadvantages: recursive, worst case too slow.