Radix sort is a non comparing sort. It's performance is O(kn), where k is the maximum number of digits in inputs's decimal representation. It uses a queue to store number for each decimal digit. At each pass, it simply classifies inputs depending on the current decimal digit, starting from the least significant one.

Quick sort is very famous and efficient algorithm for sorting an arbitrary array. It first partitions the array with any pivot value then sorts each partitions recursively. It has worst case running time of O(n^2). But, an average case running time of O(n log n). Quick sort even out performs other sorting algorithms that have average case running time of O(n log n).

Merge sort is an O(n log n) comparison-based sort algorithm. In most implementations it is stable, meaning that it preserves the input order of equal elements in the sorted output. The algorithm uses the a divide and conquer algorithmic paradigm.

Invented by John von Neumann in 1945.

Selection sort is an in-place comparison sort algorithm. It is inefficient and performs worse than many other sorting algorithms like merge sort. Nevertheless, it is very simple and can be used for sorting small amounts of data.