Talk:Fractal tree: Difference between revisions

← Older edit

Talk:Fractal tree (view source)

Revision as of 14:25, 20 January 2022

1,977 bytes added , 2 years ago

→‎java: new section

Anonymous user

rosettacode>Xdv

Revision as of 15:27, 16 August 2010 (view source) Rdm (talk \| contribs) m (spelling) ← Older edit		Latest revision as of 14:25, 20 January 2022 (view source) rosettacode>Xdv (→‎java: new section)
(6 intermediate revisions by 4 users not shown)
Line 117: Going further (combining the above): To do all of these additional exercises, I might want to refactor the code slightly to make things easier. For example, I could do the "fat line" thing and then rotate all polylines by angle a0. ==Python code== Are changes to the Python versions not allowed or strongly discouraged? :Edits to all examples are encouraged as long as they are correct. If they are drastically different it may be more beneficial for the community to add additional examples for the same language. --[[User:Mwn3d\|Mwn3d]] 02:46, 5 March 2011 (UTC) :Yep. Nothings sacred as such, but we encourage ''improvements'' :-) :--[[User:Paddy3118\|Paddy3118]] 07:08, 5 March 2011 (UTC) == Task == Hi, There are some differences between solutions : * different angles and levels ( depth ) * some programs draw on the screen, some to different raster ( ppm, bmp, png) or vector ( svg) graphic files Is it possible to add : * statistic about each program ( number of lines and words of code, maybe time of computing on the same computer , ...) * description about each program : what technique and data types it uses, 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) == java == It works.--[[User:Xdv\|xarilaos]] ([[User talk:Xdv\|talk]]) 14:25, 20 January 2022 (UTC)