Lesson plan

Comb sort

Comb sort is a relatively simple sorting algorithm originally designed by Włodzimierz Dobosiewicz and Artur Borowy in 1980, later rediscovered (and given the name "Combsort") by Stephen Lacey and Richard Box in 1991. Comb sort improves on bubble sort in the same way that Shellsort improves on insertion sort, in that they both allow elements that start far away from their intended position to move more than one space per swap. NIST's Dictionary of Algorithms and Data Structures defines comb sort and Shellsort as types of "diminishing increment sort" , but mentions that Don Knuth uses that name as a synonym for Shellsort, while other authors use the name "comb sort" for the entire class.

Back to article

Article summary

Comb sort is a relatively simple sorting algorithm originally designed by Włodzimierz Dobosiewicz and Artur Borowy in 1980, later rediscovered (and given the name "Combsort") by Stephen Lacey and Richard Box in 1991. Comb sort improves on bubble sort in the same way that Shellsort improves on insertion sort, in that they both allow elements that start far away from their intended position to move more than one space per swap. NIST's Dictionary of Algorithms and Data Structures defines comb sort and Shellsort as types of "diminishing increment sort" , but mentions that Don Knuth uses that name as a synonym for Shellsort, while other authors use the name "comb sort" for the entire class.

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.