Algorithms, 4th Edition ∙ Robert Sedgewick and Kevin Wayne ∙ Copyright © 2002–2011 ∙ December 31, 2012 8:42:36 AM

2.1 Selection Sort Demo

click to begin demo

2

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

remaining entries

i

3

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

i min

remaining entries

4

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

i min

remaining entries

5

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

remaining entries in final order

i

6

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

remaining entries

i min

in final order

7

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i min

8

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

remaining entries in final order

i

9

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

remaining entries

i min

in final order

10

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i min

11

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

remaining entries in final order

i

12

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

remaining entries

i min

in final order

13

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i min

14

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i

15

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i min

16

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i min

17

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i

18

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i min

19

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i min

20

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i

21

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i min

22

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i min

23

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i

24

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i min

25

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i min

26

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i

27

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i min

28

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order remaining entries

i min

29

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

in final order

30

• In iteration i, find index min of smallest remaining entry.

• Swap a[i] and a[min].

Selection sort

sorted