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?(adsbygoogle = window.adsbygoogle || []).push({});

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?

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# How are there so many sorting algorithms?

Loading...

Similar Threads - many sorting algorithms | Date |
---|---|

How many bytes are there in a language? | Jan 17, 2018 |

Need some information about Shell Sort | Apr 24, 2017 |

Why so many number systems? | Nov 21, 2015 |

Minimization of many-variable function | Oct 14, 2015 |

Take integer and find divisors,prime? & how many divisors | Oct 8, 2015 |

**Physics Forums - The Fusion of Science and Community**