1.2.12

Bubble Sort

Test yourself

Bubble Sort

Bubble sort is a naive sorting algorithm.

Illustrative background for The conceptIllustrative background for The concept ?? "content

The concept

  • Imagine that you have a set of cards face up on the desk.
  • If the first two cards are in the wrong order, you swap them.
  • Then do the same for the second and third cards, and continue in this pattern until the end of the pack. This is known as a pass.
  • The highest value will 'bubble' up to the top of the pack each pass.
  • By repeating this enough times, the pack will get sorted.
Illustrative background for In EnglishIllustrative background for In English ?? "content

In English

  • Compare the first two items of the dataset:
    • If they are in the wrong order, swap them.
  • Continue for the rest of the cards in the deck.
  • Repeat the whole process, until a pass with no swaps happens.
Illustrative background for Pros and cons of bubble sortIllustrative background for Pros and cons of bubble sort ?? "content

Pros and cons of bubble sort

  • Pros:
    • Easy to implement.
    • Does not use much memory.
  • Cons:
    • Poor for efficiency.

Jump to other topics

1Computational Thinking & Algorithms

2Programming

3Hardware & Software

4Data

5The Internet

6Online Safety & Security

Go student ad image

Unlock your full potential with GoStudent tutoring

  • Affordable 1:1 tutoring from the comfort of your home

  • Tutors are matched to your specific learning needs

  • 30+ school subjects covered

Book a free trial lesson