Selection Sort

• a brute-force sorting algorithm

1. set i = 0
2. Repeatedly find the smallest element, and swap it with the ith element
3. update i += 1

Bubble Sort

Range-limiting Bubble Sort

Alternating Bubble Sort

Insertion Sort

• Partial sorting

Merge Sort

• A recursive divide-and-conqure algorithm
• Divide the list into two sub-lists recursively
• Merge the two sorted sub-lists

Merge sort requires an additional array for intermediate storage. Therefore, if memory is an issue in your application, go with the quicksort.

Quicksort

in place

Bucket sort

Radix sort