Bubble Sort
Also known as: bubblesort
A simple sorting algorithm that repeatedly compares adjacent elements and swaps them if out of order. Easy to understand and implement; good teaching example — but inefficient for large datasets.
💡 Intuition
Heavier bubbles sink and lighter bubbles rise — larger values slowly move to the end of the list.
Core Idea
Each pass moves the largest unsorted element to its correct position at the end.
🔬 Example
🎯 Why It Matters
Easy to understand and implement; good teaching example — but inefficient for large datasets.
⚠️ Common Confusion
Bubble sort is O(n²) — avoid it for large data; use merge sort or quick sort instead.
Related Concepts
Prerequisites
Next Steps
How Bubble Sort Connects to Other Ideas
To understand bubble sort, you should first be comfortable with sorting, iteration and efficiency. Once you have a solid grasp of bubble sort, you can move on to merge sort.
Go Deeper
Frequently Asked Questions
What is Bubble Sort in CS Thinking?
A simple sorting algorithm that repeatedly compares adjacent elements and swaps them if out of order.
Why is Bubble Sort important?
Easy to understand and implement; good teaching example — but inefficient for large datasets.
What do students usually get wrong about Bubble Sort?
Bubble sort is O(n²) — avoid it for large data; use merge sort or quick sort instead.
What should I learn before Bubble Sort?
Before studying Bubble Sort, you should understand: sorting, iteration, efficiency.