Insertionsort (int data[],int n) { int tmp,i,j; for (j=1; j=0) && (tmp < data[i]) ) { data[i+1] = data[i]; i--; } data[i+1] = tmp; } }