Algorithm: Selection Sort

• What am I doing?

  • Swap smallest of A[0..m] with A[0].
  • Swap smallest of A[1..m] with A[1].
  • Swap smallest of A[2..m] with A[2].
  • . . .
  • Swap smallest of A[m-1..m] with A[m-1].

Previous slide

Next slide

Back to first slide

View graphic version