Bubble Sort Visualization
Bubble Sort is a simple sorting algorithm that works by repeatedly swapping adjacent elements if they are in the wrong order. This process continues until the list is fully sorted. While it's easy to understand, Bubble Sort is not very efficient for large datasets due to its quadratic time complexity. It’s often used for educational purposes or as a baseline for comparison with other sorting algorithms.
Pseudocode
for i = 1 to (n - 1):
swapped = false
for j = 1 to (n - i):
if arr[j] < arr[j - 1]:
swap(j, j - 1)
swapped = true
if not swapped: break
Visualizer
Select number of elements:
How It Works
Bubble Sort begins at the start of the array and compares the first two elements. If the first element is greater than the second, they are swapped. The algorithm then moves to the next pair and repeats the comparison. After one complete pass through the array, the largest element will have "bubbled up" to the last position. The algorithm then repeats the process for the remaining unsorted portion, ignoring the already-sorted elements at the end. This continues until no swaps are needed in a full pass, indicating the array is sorted.
When To Use
Bubble Sort is primarily used as a teaching tool to introduce sorting concepts because of its simplicity. In practice, more efficient divide-and-conquer algorithms are preferred for large datasets. However, Bubble Sort can be useful for very small arrays or when the data is nearly sorted, as its optimized version achieves O(n) performance in the best case.
Time & Space Complexity
Metric / Operation | Complexity | Description |
|---|---|---|
| Best Case | O(n) | When the array is already sorted and the optimized version detects no swaps in the first pass. |
| Average Case | O(n²) | On average, each element must be compared with every other element. |
| Worst Case | O(n²) | When the array is sorted in reverse order, every possible swap must be performed. |
| Space Complexity | O(1) | Bubble Sort is an in-place algorithm that only requires a constant amount of additional memory for the swap variable. |
Common Interview Questions
How can Bubble Sort be optimized to detect an already sorted array in O(n) time?
By introducing a boolean flag swapped inside the outer loop. If an entire inner pass completes without making a single swap, the array is already sorted, and we can terminate early.
Why is Bubble Sort considered a stable sorting algorithm?
Bubble Sort only swaps adjacent elements when one is strictly greater than the next. Equal elements are never swapped, preserving their relative ordering.
What is the "rabbits and turtles" problem in Bubble Sort?
Large elements near the beginning ("rabbits") move quickly to the end in a single pass, but small elements near the end ("turtles") move towards the beginning by only one position per pass.
Compare Bubble Sort and Insertion Sort when sorting nearly sorted data.
While both achieve O(n) best-case time complexity on sorted data, Insertion Sort makes fewer comparisons and assignment operations in practice. Bubble Sort requires multiple pass checks and explicit swap logic compared to Insertion Sort's shift operations.
💬 Discussion
Sign in to join the discussion
Curious to Learn More?
Hand-picked resources to deepen your understanding
© 2025 See Algorithms. Code licensed under MIT, content under CC BY-NC 4.0