Key Concepts

Review core concepts you need to learn to master this subject

Bubble Sort Algoritm

The Bubble Sort algorithm is a simple algorithm to sort a list of N numbers in ascending order. Bubble sort works by iterating through a list and checking whether the current element is larger or smaller than the next element.

This algorithm consists of an outer iteration and an inner iteration. In the inner iteration, the first and second elements are first compared and swapped so that the second element has a higher value than the first. This is repeated for the subsequent second and third element pairs and so forth until the last pair of (N-2, N-1) elements is compared. At the end of the inner iteration, the largest element appears last. This is repeated for all elements of the list in the outer iteration.

Arrow Chevron Left Icon
Bubble Sort: Conceptual
Lesson 1 of 2
Arrow Chevron Right Icon
  1. 1
    Bubble sort is an introductory sorting algorithm that iterates through a list and compares pairings of adjacent elements. According to the sorting criteria, the algorithm swaps elements to shift …
  2. 2
    As mentioned, the bubble sort algorithm swaps elements if the element on the left is larger than the one on the right. How does this algorithm swap these elements in practice? Let’s say we have …
  3. 3
    Given a moderately unsorted data-set, bubble sort requires multiple passes through the input before producing a sorted list. Each pass through the list will place the next largest value in its prop…
  4. 4
    Bubble sort is an algorithm to sort a list through repeated swaps of adjacent elements. It has a runtime of O(n^2). For nearly sorted lists, bubble sort performs relatively few operations since it…
  1. 1
    The Bubble Sort algorithm works by comparing a pair of neighbor elements and shifting the larger of the two to the right. Bubble Sort completes this by swapping the two elements’ positions if the f…
  2. 2
    Now that we know how to swap items in an array, we need to set up the loops which check whether a swap is necessary. Recall that Bubble Sort compares neighboring items and if they are out of orde…
  3. 3
    As you were writing Bubble Sort, you may have realized that we were doing some unnecessary iterations. Consider the first pass through the outer loop. We’re making n-1 comparisons. nums = [5, 4,…

How you'll master it

Stress-test your knowledge with quizzes that help commit syntax to memory

Pro Logo