Talk:Sorting algorithms/Quicksort: Difference between revisions
Content added Content deleted
(request for clarification) |
No edit summary |
||
Line 4: | Line 4: | ||
* Should the program as given work for all arrays with indexes "of any discrete type", or should I pick one "discrete type" and give an example with that? |
* Should the program as given work for all arrays with indexes "of any discrete type", or should I pick one "discrete type" and give an example with that? |
||
--[[User:Kevin Reid|Kevin Reid]] 15:42, 3 October 2007 (MDT) |
--[[User:Kevin Reid|Kevin Reid]] 15:42, 3 October 2007 (MDT) |
||
:I'd say follow example of the [[Bubble Sort]] page (from which I stole the text). In other words, do whatever is most comfortable in your language, perhaps pointing out the design choices made. --[[User:IanOsgood|IanOsgood]] 19:02, 3 October 2007 (MDT) |
Revision as of 01:02, 4 October 2007
Details I'm uncertain on:
- Should it be the in-place form of quicksort, or is it unspecified?
- What is a discrete type?
- Should the program as given work for all arrays with indexes "of any discrete type", or should I pick one "discrete type" and give an example with that?
--Kevin Reid 15:42, 3 October 2007 (MDT)
- I'd say follow example of the Bubble Sort page (from which I stole the text). In other words, do whatever is most comfortable in your language, perhaps pointing out the design choices made. --IanOsgood 19:02, 3 October 2007 (MDT)