Timeline for Quicksort explained to kids
Current License: CC BY-SA 3.0
19 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 20, 2012 at 13:47 | answer | added | TimB | timeline score: 2 | |
| Apr 20, 2012 at 8:12 | comment | added | Raphael | Note also Computer Science Unplugged. | |
| Apr 20, 2012 at 6:53 | comment | added | Vincent Gable | I would give up on attempting to fully explain quicksort, and instead try to give the kids an understanding of "divide and conquer". Even if they aren't old enough to fully grok recursion, the idea of breaking a big problem into smaller problems would be really valuable. Personally I'd take a solid foundational understanding of divide-and-conquor any day over an incomplete notion of complex algorithms. | |
| Apr 20, 2012 at 5:08 | history | tweeted | twitter.com/#!/StackCompSci/status/193204594963259393 | ||
| Apr 19, 2012 at 23:20 | answer | added | gbjbaanb | timeline score: 1 | |
| Apr 19, 2012 at 23:06 | vote | accept | Jonathan Prieto-Cubides | ||
| Apr 19, 2012 at 21:39 | answer | added | Kevin | timeline score: 14 | |
| Apr 19, 2012 at 21:16 | vote | accept | Jonathan Prieto-Cubides | ||
| Apr 19, 2012 at 23:06 | |||||
| Apr 19, 2012 at 21:11 | history | edited | Ken Li | edited tags | |
| Apr 19, 2012 at 21:11 | history | edited | Gilles 'SO- stop being evil' | CC BY-SA 3.0 | English; formatting; reverted to original question about kindergarden |
| Apr 19, 2012 at 21:08 | answer | added | Mason Wheeler | timeline score: 16 | |
| Apr 19, 2012 at 21:08 | comment | added | Gilles 'SO- stop being evil' | Oh, 1st year math students? This is a completely different question! 1st year math students have even heard of logarithms (at least in my country). I've edited your question back to the original version. If you're having trouble explaining to freshmen, ask a separate question. | |
| Apr 19, 2012 at 21:07 | history | migrated | from programmers.stackexchange.com (revisions) | ||
| Apr 19, 2012 at 21:05 | comment | added | Giorgio | "O(n Log(n))": Quick Sort has worst-case complexity O(n^2). | |
| Apr 19, 2012 at 20:33 | comment | added | Emmad Kareem | The paper you talk about has a catchy title but very complex content such as Hilbert Space Model, so what are you after really? | |
| Apr 19, 2012 at 20:27 | comment | added | Muhammad Alkarouri | I wouldn't actually suggest it for Kindergarten, but search youtube for quicksort (and other sorting algorithms) provide many good representations. I personally prefer the Hugarian folk dance ones. See youtube.com/watch?v=ywWBy6J5gz8 . | |
| Apr 19, 2012 at 20:27 | comment | added | alfa64 | Try to use their language, the problem is that it's very limited and biologically they are not ready for this complexity. Following steps as in an algorithm is not fully developed until they are six or seven years old. You are facing a biological challenge. | |
| Apr 19, 2012 at 20:25 | comment | added | DeadMG | You want to prove the complexity of quicksort... to a bunch of three year olds...? Good luck. | |
| Apr 19, 2012 at 20:23 | history | asked | Jonathan Prieto-Cubides | CC BY-SA 3.0 |