Sorting Algorithms in a few Words

This note contains the basic ideas of different sorting algorithms in brief and plain words. It is for my own revision purpose and does not guarantee to be fully accurate.

Selection Sort

  • Start from A[0] (subject), find the smallest number among all elements
  • Swap the subject element with the smallest number that was found
  • Repeat the above steps start from the next position (A[1])
  • Keep on repeating until the last cycle
  • It is basically the…