Great sorting techniques demonstrated through horrible music
On first viewing, Sorting out Sorting is an example of the worst of computer nerds: bad techno and slow demonstrations. One example of a sorting algorithm is 6 minutes; luckily, they spare us the 52 minute example in the end.
However, Tim will now tell us why it's good. Tim agrees that the demonstrations are slow; however, they act as a fantastic visual aid to help understand the mechanisms behind some of the more complex sorting algorithms.
11 of 11 people found this review helpful.
Was this review helpful to you?
| Report this