Skip to main content
12 events
when toggle format what by license comment
Nov 23, 2014 at 19:38 answer added Leorge Takeuchi timeline score: 0
Sep 24, 2014 at 21:30 history tweeted twitter.com/#!/StackProgrammer/status/514889524489371648
Sep 23, 2014 at 11:02 comment added MSalters You're running quicksort down to chunks of 2 elements? Because real-world implementations tend to use simpler sorts for small chunks. E.g. compare-and-swap is a lot simpler than quicksort for N=2.
Sep 23, 2014 at 5:39 vote accept mrQWERTY
Sep 23, 2014 at 5:19 answer added david.pfx timeline score: 9
Sep 23, 2014 at 5:03 comment added user40980 @Renren29 I've modified the question a bit trying to move it to focus on the reason why quicksort would have difficulty with a given array rather than seeking example arrays (I don't people to be giving you answers of [2,1,2,1,2,1,2,1] and that being the entire answer). The goal of the question would, ideally, be one where other people can come and find out more about the why (which has an answer) rather than examples (of which there are countless).
Sep 23, 2014 at 5:01 history edited user40980 CC BY-SA 3.0
Modify question focus to be the conditions for when quicksort does badly rather than examples.
Sep 23, 2014 at 4:33 comment added mrQWERTY @WinstonEwert Pivot is selected by the first element.
Sep 23, 2014 at 4:21 comment added user40980 Please give Worst case for QuickSort - when can it occur? on StackOverflow a read. I also find sorting.at to be a nice visualization of the sorting algorithms.
Sep 23, 2014 at 4:19 comment added Winston Ewert How is the pivot selected? You stated two ways it wasn't selected, but not how it was selected.
Sep 23, 2014 at 4:18 review First posts
Sep 23, 2014 at 9:54
Sep 23, 2014 at 4:11 history asked mrQWERTY CC BY-SA 3.0