Wadler's Blog: Sorting algorithms as folk dances

12.4.11

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.

# posted by Philip Wadler @ 2:57 PM

Comments:

Shell sort is faster than O(N^2)

# posted by

Anonymous : 12/4/11 5:33 PM

They've now added merge sort and quicksort as well!

# posted by

Maurice : 11/6/11 8:51 AM

This comment has been removed by the author.

# posted by

Anonymous : 6/5/13 11:34 AM

1.Heap Sort in C
2.Bubble Sort in C
3.Insertion Sort in C
4.Selection Sort in C
5.Quick Sort in C

# posted by

Anonymous : 21/7/13 3:14 PM

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.

# posted by

Anonymous : 5/2/15 6:14 PM

Post a Comment

<< Home