Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 313: / Line 313: @@
     foreach (i; 1 .. data.length) {
         auto value = data[i];
-        int j = i - 1;
+        ptrdiff_t j = i - 1;
         while (j >= 0 && data[j] > value) {
             data[j + 1] = data[j];