selection-sort - Read For Learn

Best case time complexity for selection sort

For selection sort you have to search the minimum and put it on the first place in the first iteration. In the second iteration you have to search the minimum in the non-sorted part of the array and put it to the second place and so on… You only know which element is the minimum … Read more

Insertion Sort vs. Selection Sort

Selection Sort: Given a list, take the current element and exchange it with the smallest element on the right hand side of the current element. Insertion Sort: Given a list, take the current element and insert it at the appropriate position of the list, adjusting the list every time you insert. It is similar to … Read more