Insertion Sort Algorithm

for i = 1 to n-1

temp = a[i]

loc = i

while(locɬ && (a[loc-1]> temp)

a[loc] = a[loc-1]

loc = loc –1

a[loc] = temp

Previous slide

Next slide

Back to first slide

View graphic version