Example for Bubble Sort

So we take an array with 5 elements (-3, 15, 0, 8, -7) and we have to sort elements in Ascending Order.

First Iteration:

1. Starting from the first index, compare the first and the second element.
2. If it comes out that the first element is greater than the second element, then they both are swapped.
3. Now, compare the second and the third elements. If is comes out that they are not in order then swap them.
4. The above process continues till the last element.

Remaining Iteration

1. So, we perform the same process for the remaining iterations.
2. After eeach iteration, the largest element among the unsorted elements is placed at the end of the array.

In each iteration the comparison continues up to the last unsorted element.

When all the unsorted elements are placed at their correct positions, the array becomes sorted.