FilesExpand file tree

 master

/

desc.json

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

13 lines (13 loc) · 802 Bytes

 master

/

desc.json

Copy path

Top

File metadata and controls

• Code
• Blame

13 lines (13 loc) · 802 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

{

"Comb Sort": "Comb sort is a relatively simple sorting algorithm originally designed by Włodzimierz Dobosiewicz in 1980. Later it was rediscovered by Stephen Lacey and Richard Box in 1991. Comb sort improves on bubble sort. <br /><br />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.",

"Complexity": {

"time": "worst $O(n^2)$, best $O(n \\,log \\,n)$, average $O(n^2 / 2^p)$, where $p$ is the number of increment)",

"space": "worst $O(1)$ auxiliary"

},

"References": [

"<a href='https://en.wikipedia.org/wiki/Comb_sort'>Wikipedia</a>"

],

"files": {

"basic": "Bubble sort"

}

}