Selection Sort Algorithm

for i = 0 to n-2

temp = a[i]

loc = i;

for j = i+1 to n-1

if a[j] < a[loc]

loc = j

a[i] = a[loc]

a[loc] = temp

Previous slide

Next slide

Back to first slide

View graphic version