Bubble sort is an algorithm that compares adjacent elements and swaps them if they are in the wrong order, with the lightest element rising to the top with each iteration. It works by comparing pairs of adjacent items, swapping any that are out of order so the lightest rises to the left side, then repeating for the next pair. This process continues until the list is fully sorted from lowest to highest value.

1. By Sabrina & Shaun

2. • Bubble sort consists of comparing each pair of adjacent
items.
• Then one of those two items is considered smaller
(lighter) and if the lighter element is on the right side of its
neighbour, they swap places.
• Thus the lightest element bubbles to the surface and at
the end of each iteration it appears on the top (left).

3. • 1. Each two adjacent elements are compared as long
as there’s at least one element on both sides of the
numbers.
• In bubble sort we've to compare each two adjacent
elements
• Here “2″ appears to be less than “4″, so it is considered
lighter and it continues to bubble to the surface (towards
the left).

4. • Now you can see the number 7 is higher than number
2 so you need to swap number 7 with number 2

5. • Continue moving forward and swap with each
heavier item
• So in this case number 2 will be swapped with
number 8

6. • If the currently lightest element meets another item that is
lighter, then the newest currently lightest element starts
to bubble to the top
• In this case number 2 is now heavier than number 1
so number 1 be swapped with the remaining
numbers on the left and number 2 remains in the
same position

7. • Finally the lightest element is on its place, and the sort
can start again with another number from the list and this
time without having the number 1 as it has already been
sorted.