Talk:Compare sorting algorithms' performance: Difference between revisions
Content added Content deleted
No edit summary |
m (added a talk section header so the TOC is shown in the correct place.) |
||
| Line 1: | Line 1: | ||
__TOC__ |
|||
== AutoHotkey returns incorrect results for Quick Sort == |
|||
With AutoHotkey, the Quick Sort example returns incorrect results. Can anybody explain why? |
With AutoHotkey, the Quick Sort example returns incorrect results. Can anybody explain why? |
||
| Line 5: | Line 9: | ||
I've written it bottom-up unless stated otherwise for some fragments. |
I've written it bottom-up unless stated otherwise for some fragments. |
||
This task show Python strength in ad-hoc scripting. I think Ruby's version could be feasible. I don't have an expertise to write it myself. --[[User:Goku Sama|Goku Sama]] 02:49, 5 February 2008 (MST) |
This task show Python strength in ad-hoc scripting. I think Ruby's version could be feasible. I don't have an expertise to write it myself. --[[User:Goku Sama|Goku Sama]] 02:49, 5 February 2008 (MST) |
||
== Time performance vs space performance == |
== Time performance vs space performance == |
||
There are circumstances where performance is measured as a metric of space consumed vs time consumed. Does anyone have any thoughts as to how we could create a task that can measure that metric? --[[User:Short Circuit|Short Circuit]] 04:11, 8 May 2009 (UTC) |
There are circumstances where performance is measured as a metric of space consumed vs time consumed. Does anyone have any thoughts as to how we could create a task that can measure that metric? --[[User:Short Circuit|Short Circuit]] 04:11, 8 May 2009 (UTC) |
||
== optional requirement == |
== optional requirement == |
||