Sorting algorithms/Patience sort: Difference between revisions
Content deleted Content added
Line 3,114:
iStart := TotalExternalNodes;
WHILE iStart <> 1 DO
FOR i := iStart
iWinner := PlayGame (i);
Winners[i DIV 2, 1] := Winners[iWinner, 1];
|