Comb sort
Sorting algorithm
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.
Nº Q133939 ★
Common · Knowledge
Comb sort
Sorting algorithm
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.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
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.
Text: Wikipédia, CC BY-SA 4.0. · Image: Jerejesse (CC BY-SA 3.0) ·
Related cards
-
Bubble sort
Simple sorting algorithm
Nº Q60864 ★★★
Not listed
-
L
Library sort
Sorting algorithm
Nº Q3495147 ★
Not listed
-
Tony Hoare
British computer scientist
Nº Q92602 ★★
Not listed
-
Shellsort
In-place comparison sorting algorithm invented by D. Shell
Nº Q848955 ★★
Not listed
-
Bucket sort
Sorting algorithm
Nº Q6787153 ★
Not listed
-
B
Burrows–Wheeler transform
Algorithm used in data compression techniques
Nº Q2806 ★
Not listed