Anonymous user
Talk:Quickselect algorithm: Difference between revisions
m
→How is pivot chosen?: bumped an indentation.
m (→Task Testing Values: bumped an indentation.) |
m (→How is pivot chosen?: bumped an indentation.) |
||
Line 5:
: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)
:: I saw one program that used a random number, which I used initially in the REXX solution. But I found that using a midpoint was slightly faster, and the method bypasses using the '''random''' BIF (when generating a random number). -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 10:49, 19 November 2013 (UTC)
==C# and Quicksort==
| |||