🔗 Comb Sort - Just As Good As Quick Sort

🔗 Computing 🔗 Computer science 🔗 Computing/Software 🔗 Computing/Computer science

Comb sort is a relatively simple sorting algorithm originally designed by Włodzimierz Dobosiewicz and Artur Borowy in 1980, later rediscovered by Stephen Lacey and Richard Box in 1991. Comb sort improves on bubble sort.