Sorting algorithms as folk dances

Bubble sort, shell sort, insertion sort, and selection sort, each as a Hungarian, Romanian, or Gypsy folk dance. Alas, all the algorithms are O(n^2). I long to see an O(n log n) waltz, or better yet O(n) leaping into buckets. Spotted via Boing Boing.

Shell sort is faster than O(N^2)
They've now added merge sort and quicksort as well!
This comment has been removed by the author.
check out this Heap sort program in c. Here heap sort is explained with the help of diagram and pseudocode to insert and remove root from heap.
Post a Comment

<< Home

This page is powered by Blogger. Isn't yours?