#Day14 #100DaysOfCode
selection sort: finding the minimum elements and place it at the begining of the list.
time complexity is O(n2) in 3 cases.
insertion sort: similar to the ways of sorting cards on hand. start at the second element. iteratively pick an element in the unsorted list and place it in the correct position of the sorted list.
time complexity is O(n2)
selection sort: finding the minimum elements and place it at the begining of the list.
time complexity is O(n2) in 3 cases.
insertion sort: similar to the ways of sorting cards on hand. start at the second element. iteratively pick an element in the unsorted list and place it in the correct position of the sorted list.
time complexity is O(n2)
