🔗 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.
Discussed on
- "Comb Sort - Just As Good As Quick Sort" | 2010-04-20 | 31 Upvotes 9 Comments