Talk:Sierpinski triangle: Difference between revisions
(→Graphics lib: new section) |
(reply) |
||
| Line 4: | Line 4: | ||
Would it be appropriate to redefine this task to use an assumed function named SetPixel(), as we do in a number of other tasks? --[[User:Short Circuit|Short Circuit]] 11:53, 1 May 2009 (UTC) |
Would it be appropriate to redefine this task to use an assumed function named SetPixel(), as we do in a number of other tasks? --[[User:Short Circuit|Short Circuit]] 11:53, 1 May 2009 (UTC) |
||
* That would exclude all the languages without 'bitmap storage' solutions. Also, defining it textually has the advantage that people can grab and run the code, rather than having to add libraries from elsewhere.<p>I like the idea of having graphical output ''if'' the code to do it is nice; but I think we should focus on having clear readable examples so that they are enlightening to those who do not or only barely know the languages, and beware of putting accidental complexity in the tasks that obscures the fundamentals (in this case, the chosen algorithm for constructing the points of a sierpinski triangle). --[[User:Kevin Reid|Kevin Reid]] 12:08, 1 May 2009 (UTC) |
|||
Revision as of 12:08, 1 May 2009
I'm confused about the algorithm in the JavaScript version. Could we get more descriptive variable names for u and t or maybe a pseudocode algorithm that everyone can use? --Mwn3d 16:29, 14 March 2008 (MDT)
Graphics lib
Would it be appropriate to redefine this task to use an assumed function named SetPixel(), as we do in a number of other tasks? --Short Circuit 11:53, 1 May 2009 (UTC)
- That would exclude all the languages without 'bitmap storage' solutions. Also, defining it textually has the advantage that people can grab and run the code, rather than having to add libraries from elsewhere.
I like the idea of having graphical output if the code to do it is nice; but I think we should focus on having clear readable examples so that they are enlightening to those who do not or only barely know the languages, and beware of putting accidental complexity in the tasks that obscures the fundamentals (in this case, the chosen algorithm for constructing the points of a sierpinski triangle). --Kevin Reid 12:08, 1 May 2009 (UTC)