Sorting algorithms/Insertion sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 237: / Line 237: @@
         a[j] = t;
     }
-}
-void print_array (int *a, int n) {
-    int i;
-    for (i = 0; i < n; i++) {
-        printf(" %d", a[i]);
-    }
-    printf("\n");
 }
@@ Line 250: / Line 242: @@
     int a[] = {4, 65, 2, -31, 0, 99, 2, 83, 782, 1};
     int n = sizeof a / sizeof a[0];
-    print_array(a, n);
+    int i;
+    for (i = 0; i < n; i++)
+        printf("%d%s", a[i], i == n - 1 ? "\n" : " ");
     insertion_sort(a, n);
-    print_array(a, n);
+    for (i = 0; i < n; i++)
+        printf("%d%s", a[i], i == n - 1 ? "\n" : " ");
     return 0;
+}
-}</lang>
+</lang>
 {{out}}
 <pre>
 65 2 -31 0 99 2 83 782 1
- -31 0 1 2 2 4 65 83 99 782
+-31 0 1 2 2 4 65 83 99 782
 </pre>