Jump to content

Sorting algorithms/Cycle sort: Difference between revisions

Sorting algorithms/Cycle sort (view source)

Revision as of 07:15, 30 May 2017

86 bytes added ,  7 years ago
m
→‎version 1: fixed for Cöassic Rexx
m (→‎version 4: changed alignment of a couple of comments.)
m (→‎version 1: fixed for Cöassic Rexx)
Line 1,302:
* 12.06.2014 Walter Pachl translated from Wikipedia's code
* 20.06.2014 WP corrected (courtesy Alan Sampson)
* 30.05.2017 WP fixed for Classic Rexx (courtesy GS)
**********************************************************************/
list='1 9 3 5 8 4 7 0 6 2'
Line 1,320 ⟶ 1,321:
cycleSort: procedure expose array. n
writes = 0
--/* Loop through the array to find cycles to rotate. */
do cycleStart=0 to n-2
item = array.cycleStart
 
--/* Find where to put the item. */
pos = cycleStart
Do i=cycleStart+1 to n-1
if array.i < item Then
pos += pos+1
End
 
--/* If the item is already there, this is not a cycle. */
if pos == cycleStart Then
Iterate
 
--/* Otherwise, put the item there or right after any duplicates. */
Do while item == array.pos
pos += pos+1
End
Parse Value array.pos item With item array.pos
writes += writes+1
 
--/* Rotate the rest of the cycle. */
Do while pos <> cycleStart
 
--/* Find where to put the item. */
pos = cycleStart
Do i=cycleStart + 1 to n-1
if array.i < item Then
pos += pos+1
End
 
--/* Put the item there or right after any duplicates. */
Do while item == array.pos
pos += pos+1
End
Parse Value array.pos item With item array.pos
writes += writes+1
End
End
Walterpachl
2,295

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/247946"
Cookies help us deliver our services. By using our services, you agree to our use of cookies.
More information