Anonymous user
Sorting algorithms/Cycle sort: Difference between revisions
m
→version 3: added a comment to the version 3 section header.
(→version 3: added a version 2.) |
m (→version 3: added a comment to the version 3 section header.) |
||
Line 356:
===version 3===
This version uses a faster (but a more cryptic) version of incrementing '''1''' (one) to '''P''' within two '''do''' loops.
<lang rexx>/*REXX program demonstrates a cycle sort on a list of items. */
parse arg z /* [↓] not specified? Use π digs*/
| |||