![]() |
OT: Sorting algorithms as dances - Printable Version +- HP Forums (https://archived.hpcalc.org/museumforum) +-- Forum: HP Museum Forums (https://archived.hpcalc.org/museumforum/forum-1.html) +--- Forum: Old HP Forum Archives (https://archived.hpcalc.org/museumforum/forum-2.html) +--- Thread: OT: Sorting algorithms as dances (/thread-182053.html) |
OT: Sorting algorithms as dances - Thomas Klemm - 04-12-2011
Cheers
Re: OT: Sorting algorithms as dances - Katie Wasserman - 04-12-2011 I love this, but was disappointed to not see how they would have done Quick Sort. OTOH, it makes bauble sort on the original 12C look blindingly fast. Thanks for posting this! -Katie
Edited: 12 Apr 2011, 9:27 a.m.
Re: OT: Sorting algorithms as dances - Tim Wessman - 04-12-2011 Quicksort would definitely have to be a modern dance.
TW
|