17 Oct 09



These pages show 8 different sorting algorithms on 4 different initial conditions. These visualizations are intended to:

  • Show how each algorithm operates.
  • Show that there is no best sorting algorithm.
  • Show the advantages and disadvantages of each algorithm.
  • Show that worse-case asymptotic behavior is not the deciding factor in choosing an algorithm.
  • Show that the initial condition (input order and key distribution) affects performance as much as the algorithm choice.
by mlb 16 years ago saved 2 times

This website is an experiment that uses Color Theory to randomly select a color scheme that is supposed to look nice with every refresh.

by mlb 16 years ago saved 2 times

Problèmes d’algorithmique et leurs implémentations en Caml

by mlb 16 years ago