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

In the following unsorted array - Lets compare each element