Anonymous user
Talk:Quickselect algorithm: Difference between revisions
→C# and Quicksort
(→How is pivot chosen?: Not stipulated?) |
|||
Line 4:
:Yep I saw that too, but thought I would just leave it open. It would allow some one to write an additional (or extend the current) Python solution using other pivot choices. I guess if it means a lot to someone then this is the time to create a separate task if they think it is necessary then restrict this task to be for random pivots, but I didn't think it was needed (which sounds better than I am lazy, however I can't truly remember if laziness applied in this case :-)<br>--[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 22:06, 2 October 2013 (UTC)
==C# and Quicksort==
The C# solution also includes quicksort for which we already have a [[Sorting algorithms/Quicksort|task]]. I think it would be better if C# concentrated on just what was needed for Quickselect in its codem to aid in language comparisons. -[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 04:20, 6 October 2013 (UTC)
| |||