Insertion sort algorithm

k= 0;

while (k < b.length-1) {

// Place b[k] in its sorted position in b[0..k]

int temp= b[k]; //Save b[k] in temp

h= k;

// Inv: b[0..k] is sorted except for position b[h], temp <= b[h+1..k]

while (h != 0) && b[h-1]>=temp) {

b[h]= b[h-1];

h= h-1;

}

// Note: {b[0..h-1] <= temp <= b[h+1..k]}

b[h]= temp;

}

k= k+1;

}

Previous slide

Next slide

Back to first slide

View graphic version