In every iteration of selection sort, the minimum element (considering ascending order) from the unsorted subarray is picked and moved to the sorted subarray.

• Worst-case performance O(n^2)
• Best-case performance O(n)
• Average case performance O(n^2)

read more at: Wikipedia
code: Bubble sort

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm, which is a comparison sort, is named for the way smaller elements "bubble" to the top of the list. Although the algorithm is simple, it is too slow and impractical for most problems even when compared to insertion sort. It can be practical if the input is usually in sorted order but may occasionally have some out-of-order elements nearly in position.

• Worst-case performance O(n^2)
• Best-case performance O(n)
• Average case performance O(n^2)

read more at: Wikipedia
code: Bubble sort

Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.

• Worst-case performance O(n^2)
• Best-case performance O(n)
• Average case performance O(n^2)

read more at: Wikipedia
code: Insertion sort