|
#include <stdio.h>
#define size(x) (sizeof(x) / sizeof(x[0]))
/* Prototypen */
void insertion_sort(int*,int);
//Insertion Sort
int main(void){
int a[] = {88,25,24,19,62,12,17};
//before sorting
for(int i=0; i<size(a); i++) {
printf("i: %i a[i]: %i\n",i,a[i]);
}
printf("\n");
insertion_sort(a,size(a));
//after sorting
for(int i=0; i<size(a); i++) {
printf("i: %i a[i]: %i\n",i,a[i]);
}
return 0;
}
void insertion_sort(int *a, int n){
int dummy,i,j;
for (i=1; i<n; i++){
dummy = a[i];
j = i;
while(j>0 && dummy < a[j-1]){
printf("j: %i a[j]: %i a[j-1]: %i\n",j,a[j],a[j-1]);
a[j]=a[j-1];
j--;
}
a[j] = dummy;
}
printf("\n");
}
|
Ctrl + V, Paste whatever is in your clipboard and post without editing.
Dec 1 2014, 08:35
