Skip to content
This repository was archived by the owner on Sep 7, 2025. It is now read-only.

Conversation

@gastonche
Copy link
Contributor

The Comb Sort is a variant of the Bubble Sort. Like the Shell sort, the Comb Sort increases the gap used in comparisons and exchanges. Some implementations use the insertion sort once the gap is less than a certain amount. The basic idea is to eliminate turtles, or small values near the end of the list, since in a bubble sort these slow the sorting down tremendously. Rabbits, large values around the beginning of the list, do not pose a problem in bubble sort. In bubble sort, when any two elements are compared, they always have a gap of 1. The basic idea of comb sort is that the gap can be much more than 1. 
@abranhe
Copy link
Member

abranhe commented Oct 2, 2018

The same issue as #21, docs should not be here! Please fix that for the pull request to be merged.

Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.

2 participants