KwickClips Java · 40 sec · free
Which sort makes the fewest swaps?
Short answer. Selection sort, with at most one per pass.
Which is best when the array is nearly sorted?
Insertion sort.
Three sorts
| Sort | Idea |
|---|---|
| Bubble | swap pairs |
| Selection | pick smallest |
| Insertion | shift, insert |
Remember
| Selection: fewest swaps |
| Insertion: best if nearly sorted |
Three sorts. How are they different? Here is the difference. Bubble swaps neighbours. Selection picks the smallest. Insertion shifts and inserts. Selection makes the fewest swaps. Insertion is best when nearly sorted.
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
Can a sort swap only once per pass?39 sec
What is insertion sort like?37 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.