- Simplest sorting Algorithm
- Run two nested loops and compare every element with it’s adjacent element .
- if an element is greater than its next element, swap their places

In the following unsorted array -
Lets compare each element



In the following unsorted array -
Lets compare each element

