Sorting algorithms/Comb sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 504: / Line 504: @@
             input size > 0
          THEN # non-empty array, so must sort #
-            INT  gap       := input size; # initial gap is the whole array size #
+            INT  gap     := input size; # initial gap is the whole array size #
             BOOL swapped := TRUE;
             WHILE gap /= 1 OR NOT swapped DO