Talk:Compare sorting algorithms' performance: Difference between revisions
Content added Content deleted
m (I've written it bottom-up unless stated otherwise.) |
(→Time performance vs space performance: new section) |
||
| Line 3: | Line 3: | ||
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 == |
|||
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) |
|||
Revision as of 04:11, 8 May 2009
Where did this come from? Can we get some implementations in other languages? --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. --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? --Short Circuit 04:11, 8 May 2009 (UTC)