![Page 1: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/1.jpg)
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
![Page 2: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/2.jpg)
2
• In iteration i, find index min of smallest remaining entry.
• Swap a[i] and a[min].
Selection sort
remaining entries
i
![Page 3: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/3.jpg)
3
• In iteration i, find index min of smallest remaining entry.
• Swap a[i] and a[min].
Selection sort
i min
remaining entries
![Page 4: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/4.jpg)
4
• In iteration i, find index min of smallest remaining entry.
• Swap a[i] and a[min].
Selection sort
i min
remaining entries
![Page 5: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/5.jpg)
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
![Page 6: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/6.jpg)
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
![Page 7: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/7.jpg)
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
![Page 8: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/8.jpg)
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
![Page 9: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/9.jpg)
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
![Page 10: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/10.jpg)
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
![Page 11: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/11.jpg)
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
![Page 12: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/12.jpg)
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
![Page 13: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/13.jpg)
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
![Page 14: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/14.jpg)
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
![Page 15: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/15.jpg)
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
![Page 16: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/16.jpg)
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
![Page 17: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/17.jpg)
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
![Page 18: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/18.jpg)
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
![Page 19: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/19.jpg)
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
![Page 20: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/20.jpg)
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
![Page 21: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/21.jpg)
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
![Page 22: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/22.jpg)
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
![Page 23: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/23.jpg)
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
![Page 24: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/24.jpg)
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
![Page 25: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/25.jpg)
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
![Page 26: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/26.jpg)
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
![Page 27: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/27.jpg)
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
![Page 28: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/28.jpg)
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
![Page 29: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/29.jpg)
29
• In iteration i, find index min of smallest remaining entry.
• Swap a[i] and a[min].
Selection sort
in final order
![Page 30: Selection Sort Demo - Purdue University · 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](https://reader034.vdocument.in/reader034/viewer/2022050214/5f607ec2fb8f1f5af77ab87e/html5/thumbnails/30.jpg)
30
• In iteration i, find index min of smallest remaining entry.
• Swap a[i] and a[min].
Selection sort
sorted