Talk:Sorting algorithms/Stooge sort: Difference between revisions

No edit summary
 
(One intermediate revision by the same user not shown)
Line 34:
What is the reason to use the underscores in the variables (in NetRexx and taken over to ooRexx?
--[[User:Walterpachl|Walterpachl]] 11:24, 5 July 2012 (UTC)
: Just personal style; I strongly disapprove of single character variables and the pseudo-code on which the solution was based used single characters. Adding underscore to the names was a less invasive change than renaming the variables (but would perhaps have made the code more self-explanatory: mea culpa). However using underscore in iterator names helps me find them easily and with iterators, concise is nice. Another plus is that it's easier to &nbsp; <strike>but</strike> put &nbsp; the cursor between two characters when double-clicking than to try to grab a single character in some IDEs. --[[User:Alansam|Alansam]] 15:12, 5 July 2012 (UTC)
----
ooRexx solution:
Line 49:
You don't USE the java here, do you?
--[[User:Walterpachl|Walterpachl]] 15:59, 5 July 2012 (UTC)
 
== task requirement clarification ==
Just to be clear(er): &nbsp; Is the task requirement to show the '''output''' of a Stooge Sort, or just show the algorithm? &nbsp; Most (but not all) include output, but some examples only show a subroutine without an invoking (main) program. &nbsp; -- [[User:Gerard Schildberger|Gerard Schildberger]] ([[User talk:Gerard Schildberger|talk]]) 21:44, 4 April 2016 (UTC)