View difference between Paste ID: JW1vMP61 and 8uAdRbtU

 #include <stdio.h>
 
 void print(int array[], int length) {
     int i;
     printf("{ %d", array[0]);
     for (i = 1; i < length; i++)
         printf(", %d", array[i]);
     printf(" }\n");
 }
 
-void scambiamin(int array[], int start, int length) {
+
-    int i, min = start;
+    int i, j, min, first;
-    for (i = start + 1; i < length; i++)
+    for (i = 0; i < length -1; i++) {
-        if (array[i] < array[min]) min = i;
+
         // find the index of the minimum
-    int primo = array[start];
+        min = i;
-    array[start] = array[min];
+        for (j = i +1; j < length; j++)
-    array[min] = primo;
+            if (array[j] < array[min]) min = j;
 
         // put the minimum on top
         first = array[i];
         array[i] = array[min];
-    for (i = 0; i < length -1; i++)
+        array[min] = first;
-        scambiamin(array, i, length);
+    }
 }
 
 void insertionsort(int array[], int length) {
-    int test[] = {5, 7, 86, 2, -7, 6, 6};
+    int i, j, curr;
-    print(test, 7);
+    for (i = 0; i < length; i++) {
-    selectionsort(test, 7);
+        curr = array[i];
-    print(test, 7);
+        for (j = i-1; j >= 0 && array[j] > curr; j--)
             array[j+1] = array[j];
         array[j+1] = curr;
     }
 }
 
 main() {
     int a[] = {5, 7, 86, 2, -7, 6, 6};
     printf("selection sort:\n");
     print(a, 7);
     selectionsort(a, 7);
     print(a, 7);
 
     int b[] = {98, -72, 45, 3, 5, -1};
     printf("insertion sort:\n");
     print(b, 6);
     insertionsort(b, 6);
     print(b, 6);
 }