The inner loop in the above algorithm finds the location of the next smallest element in the array (the location of the next smallest element in the array).

• The inner loop in the above algorithm finds the location of the next smallest element in the array (the location of the next smallest element in the array).

• The outer loop moves along the array as the elements are sorted.

• What is the complexity of selection sort?

Previous slide

Next slide

Back to first slide

View graphic version