Rosetta Code

Sorting algorithms/Bogosort: Difference between revisions

Page Discussion

Sorting algorithms/Bogosort (view source)

Revision as of 22:16, 12 January 2009

127 bytes removed ,  15 years ago
m
→‎{{header|Oberon-2}}
Line 388:
RETURN TRUE;
END Sorted;
 
PROCEDURE PrintArray(VAR a: ARRAY OF INTEGER);
VAR i: INTEGER;
BEGIN
FOR i := 0 TO LEN(a) - 1 DO▼
Out.Int(a[i], 0);▼
Out.String(" ");▼
END;▼
END PrintArray;
 
PROCEDURE Shuffle*(VAR a: ARRAY OF INTEGER);
Line 415 ⟶ 406:
Shuffle(a);
END;
▲ FOR i := 0 TO LEN(a) - 1 DO
PrintArray(a);
▲ Out.Int(a[i], 0);
▲ Out.String(" ");
▲ END;
Out.Ln;
END Bogo.</pre>
 
Init initializes the array as 1.. thru 10, then it is shuffled, and then the while loop continually shuffles until Sorted returns true.
 
=={{header|OCaml}}==
Anonymous user
Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/72133"