1. Set the first element as minimum
  2. Compare minimum with the second element. If the second element is smaller than minimum, assign second element as minimum.
  3. Compare minimum with the third element. Again, if the third element is smaller, then assign minimum to the third element otherwise do nothing. The process goes on until the last element.
  4. After each iteration, minimum is placed in the front of the unsorted list.
  5. For each iteration, indexing starts from the first unsorted element. Step 1 to 3 are repeated until all the elements are placed at their correct positions.