Quicksort exercise 9-10-14

Nicolas Malevé gave a lecture on an introduction to Algorithms.
The slides are here

A physical exercise explained one algorithm more in depth: quicksort. A series of randomly numbered cards are put on the floor, the middle one becomes reference card. The numbers lower then the reference qo to the left, the numbers highr to the right. The two new groups are split the same way. after several iterations the cards are ordered from low to high numbers.





Plus d’images ici:

One thought on “Quicksort exercise 9-10-14

  1. Pingback: Quicksort exercise | The Networked Social

Comments are closed.