This page represents only my own views, and not those of any university or other body.
Posted Thursday 19th April at 9.15pm
Kindergarten complexity
Someone on the computer science stack exchange linked to my site as part of an answer to the question "I wonder how to explain quicksort in the simplest words possible. How can I prove (or at least handwave) that the average complexity is O(nlogn), and what the best and the worst cases are, to a kindergarden class? Or at least in primary school?" (Admittedly the main point of the answer was the animated gif from wikipedia that's on my quicksort page.)
I want to meet any kindergarten class that understands on any level what O(nlogn) means, let alone why quicksort has that complexity...
Return to blog
Comments
Write a new comment: