I was looking through the list of sorting algorithms and there are so many of them! A simple problem where each element is less that or greater than the next term has so many solutions. How is that? My question is a rhetorical one but is there any limit to number of different techniques for sorting? Till now the algorithms I have read do the following:- Selection sort: Finds the minimum and places in the first position and so on Heap sort: Finds the minimum but in an efficient way using binary trees Quick sort and Merge sort: Use divide and conquer Insertion sort: Finds the correct position and places element there Surely there is a limit to number of different techniques for sorting, right?