Talk:Solve the no connection puzzle: Difference between revisions

→‎REXX annotated vs not examples.: explained the reasons concerning the two REXX versions.
(Annotated or not?)
(→‎REXX annotated vs not examples.: explained the reasons concerning the two REXX versions.)
Line 37:
==REXX annotated vs not examples.==
If the algorithm and features are the same then you should make the choice as to which to add as the most idiomatic for the language I think. You can add more explanation after the program, and yet more in the talk pages -for example see the Knights tour talk page.--[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 07:26, 10 October 2014 (UTC)
 
: The (REXX) algorithm to solve the puzzle is identical in both versions, but the feature showing the annotated graph is not.   This feature was added (to show the graph) is a fair amount of program code that was included in the second version which (I thought) distracted from the algorithm solving the problem.   So, I kept the annotation version as a separate entry to make it easier to view and understand what the first version was doing without the clutter of showing a prettier version of the output.   I felt the REXX code that showed the graph essentially wasn't part of the task requirement, and it bloated (somewhat) the first version a bit, but I admit the output is much easier on the eyes.   To me, it wasn't about which is most idiomatic, but which was easier to read because of more code to merely display the (annotated) graph. -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 07:59, 10 October 2014 (UTC)