Timeline for Strictly speaking do the Hoare and Lomuto partitioning algorithms work on the same algorithm: quicksort?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://cs.stackexchange.com/ with https://cs.stackexchange.com/
|
|
| Aug 12, 2014 at 9:02 | comment | added | David Richerby | You might prefer to call quicksort a family of algorithms but fussing over exactly what words to use isn't very productive. | |
| Aug 12, 2014 at 8:51 | comment | added | user20767 | Just because two programs output the same thing certainly does not mean they use the same algorithm. I guess what you're saying is the definition of algorithm is itself not strictly defined? | |
| Aug 12, 2014 at 5:51 | comment | added | Raphael | Disclaimer: different variants may output different things if we sort complex data with duplicate sorting keys; in particular, Quicksort is (usually) not stable. My earlier comment had pairwise distinct sorting keys resp. indistinguishable duplicate elements in mind. | |
| Aug 11, 2014 at 22:17 | comment | added | Raphael | @Celeritas Well, all variants output the exact same thing, don't they? So, arguably, the description is precise enough -- to describe the algorithm, not its execution "on the metal". Also, there is no general consensus on the necessary level of detail; from what you'll find in mathematics lectures over CS-style pseudocode used in analysis all the way to "real" code or even machine code, every form has its use. See here for an example. | |
| Aug 11, 2014 at 21:40 | comment | added | user20767 | Is it correct to call something like quicksort an algorithm? If an algorithm is a detailed step by step set of instructions, there is so much variability in quicksort depending on the partitioning method used and the pivot selection method. | |
| Aug 11, 2014 at 21:15 | history | answered | Raphael | CC BY-SA 3.0 |