TADM2E 4.41

From Algorithm Wiki
Revision as of 18:14, 11 September 2014 by Algowikiadmin (Talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Merge sort:

   *Advantages: suitable for linked list, suitable for external sort.
   *Disadvantages: need extra buffer holding the merged data.

Insertion/Selection sort:

   *Advantages: easy to implement.
   *Disadvantages: too slow and become impractical when data is huge.

Heap sort:

   *Advantages: don't need recursion. Suitable for large data.
   *Disadvantages: usually slower than merge sort and quick sort.

Quick sort:

   *Advantages: practical fastest.
   *Disadvantages: recursive, worst case too slow.