GALLERY: N 2 Sorting Algorithms

Selection sort is one of the O(n 2 ) sorting algorithms, which makes it quite inefficient for sorting large data volumes. Selection sort is notable for its programming simplicity and it can over perform other sorts in certain situations (see complexity analysis for more details).

Bubble sort is a simple and well-known sorting algorithm. It is used in practice once in a blue moon and its main application is to make an introduction to the sorting algorithms. Bubble sort belongs to O(n 2 ) sorting algorithms, which makes it quite inefficient for sorting large data volumes. Bubble sort is stable and adaptive .