KwickClips Java · 39 sec · free
Can a sort swap only once per pass?
Short answer. Yes. Selection sort finds the smallest value, then makes a single swap.
What grows after each pass?
The sorted part at the front.
Sort 29 10 14 37
| Pass | Smallest | Array |
|---|---|---|
| 1 | 10 | 10 29 14 37 |
| 2 | 14 | 10 14 29 37 |
| 3 | 29 | 10 14 29 37 |
Remember
| Find the smallest |
| One swap per pass |
Can a sort swap only once per pass? Yes. Find the smallest and swap it to the front. Ten first. Then fourteen. Then twenty nine stays. Remember. Find the smallest. One swap per pass.
This clip is from the full lesson: Sorting Arrays: Bubble, Selection and Insertion Sort — 7 minutes, with the tables, the quick answers and the whole lesson in text.
Useful for: CBSE Class 11 Information Technology (802), ICSE Class 10 Computer Applications, ISC Class 11 Computer Science (868), ISC Class 12 Computer Science (868)
More KwickClips from this lesson
Why is it called bubble sort?40 sec
What is insertion sort like?37 sec
Which sort makes the fewest swaps?40 secVoice-over is AI-generated; the script is written and checked by Kajal Ma'am. Confirm anything you plan around against your official board document. We never ask for a password or an OTP.