Sorting Algorithms
This video illustrates how several simple sorting algorithms operate, using people as the objects to be sorted. Produced by the Algorithmic Thinking class as part of Knight School 2009 at Menlo School. For people who know nothing about computer science but want to know what the heck is going on, here are brief descriptions of each sorting algorithm. Insertion Sort: Select each element in the list, and move it left until you hit somebody less than it. For example, when the element 2 is selected in
|
|