1. selection sort
    1. get the minimun, replace it with first.
    2. swap[arr[1],arr[2]];
    3. O(n^2)
  2. bubble sort

    1. swap two element

      Untitled

    2. in first round, max will reach to end

  3. Insertion sort

    1. check every guy, are you greater→swap, are you greater→ swap,

      Untitled