Anonymous user
Talk:Compare sorting algorithms' performance: Difference between revisions
Talk:Compare sorting algorithms' performance (view source)
Revision as of 16:47, 19 August 2021
, 2 years agoadded a talk section header so the TOC is shown in the correct place.
m (I've written it bottom-up unless stated otherwise.) |
m (added a talk section header so the TOC is shown in the correct place.) |
||
| (4 intermediate revisions by 4 users not shown) | |||
Line 1:
__TOC__
== AutoHotkey returns incorrect results for Quick Sort ==
With AutoHotkey, the Quick Sort example returns incorrect results. Can anybody explain why?
Where did this come from? Can we get some implementations in other languages? --[[User:Short Circuit|Short Circuit]] 23:43, 4 February 2008 (MST)
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)
== 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)
== optional requirement ==
The [[Write float arrays to a text file]] task should be marked as an optional pre-requisite. In some languages using a file for the intermediate results would just add complexity to the task. --14:36, 16 February 2010 (UTC)
| |||