Anonymous user
Talk:Fractal tree: Difference between revisions
→Task: Yea but...
(→Task: new section) |
(→Task: Yea but...) |
||
Line 139:
Regards. --[[User:Adam majewski|Adam majewski]] 05:45, 19 August 2012 (UTC)
:On RC we tend not to focus on timings as they can be hard to reproduce as they may depend on so much to describe the running environment. That doesn't stop the reader from performing his own timings however. (Although even then we tend to limit the amount of timing information or relegate it to the talk page unless it is a general indicator between timings in the same language of two different implementations and be expressed in general terms such as "X orders of magnitude for this test data"). If one can analyse the Big-O notation of example algorithms then I think that probably would be welcomed.
:Some tasks specify the exact algorithm to use - a few might also specify what datastructure also. Apart from that, you would normally have to read the code to work it out, although their are cases where novel algorithms get copied. --[[User:Paddy3118|Paddy3118]] 06:49, 19 August 2012 (UTC)
| |||