KwickClips Java · 40 sec · free
Why is it called bubble sort?
Short answer. The largest value rises to the end each pass, like a bubble.
How many passes for n values?
At most n - 1.
Sort 5 1 4 2
| Pass | Array after |
|---|---|
| Start | 5 1 4 2 |
| Pass 1 | 1 4 2 5 |
| Pass 2 | 1 2 4 5 |
| Pass 3 | 1 2 4 5 |
Remember
| Largest rises to the end |
| n values: n - 1 passes |
Why is this sort named after a bubble? Swap neighbours if the left is bigger. Pass one moves five to the end. Pass two fixes four. Pass three finds no swaps. The largest bubbles to the end. N values need N minus one passes.
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
Can a sort swap only once per pass?39 sec
What is insertion sort like?37 sec
Which sort makes the fewest swaps?40 secDisclaimer. KwickAcademy is free study material for general learning and revision. Parts of it, including the voice-over, are produced with the help of AI tools and may contain errors; if you spot one, please tell us and we will correct it. Syllabus, marks and exam details follow the latest official board publications available to us, and boards can change them at any time, so always confirm against your board's official website and your school. Using this material does not guarantee any marks or result. Board names and trademarks belong to their owners; Kwickprep is not affiliated with or endorsed by any examination board. We never ask for passwords, OTPs or ID numbers. Your progress is saved only in this browser. Full disclaimer · Privacy