Sorting algorithms/Patience sort: Difference between revisions

Content deleted Content added
Chemoelectric (talk | contribs)
Chemoelectric (talk | contribs)
Line 3,114:
iStart := TotalExternalNodes;
WHILE iStart <> 1 DO
FOR i := iStart; TO (2 * iStart) - 1 BY 2 DO
FOR i := 1 TO (2 * iStart) - 1 BY 2 DO
iWinner := PlayGame (i);
Winners[i DIV 2, 1] := Winners[iWinner, 1];