Comb sort (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Comb sort" in English language version.

refsWebsite

Global rank English rank

2^nd place

2^nd place

355^th place

454^th place

1web.archive.org

1^st place

1^st place

1clackamas.cc.or.us

low place

low place

6^th place

6^th place

archive.org

Lacey, Stephen; Box, Richard (April 1991). "A Fast, Easy Sort: A novel enhancement makes a bubble sort into one of the fastest sorting routines". Hands On. Byte Magazine. Vol. 16, no. 4. pp. 315–318, 320. Archived from the original on 2021-09-27. Entire magazine available at archive.org.

clackamas.cc.or.us

cs.clackamas.cc.or.us

Lacey, Stephen; Box, Richard (April 1991). "A Fast, Easy Sort: A novel enhancement makes a bubble sort into one of the fastest sorting routines". Hands On. Byte Magazine. Vol. 16, no. 4. pp. 315–318, 320. Archived from the original on 2021-09-27. Entire magazine available at archive.org.

doi.org

Brejová, Bronislava (15 September 2001). "Analyzing variants of Shellsort". Information Processing Letters. 79 (5): 223–227. doi:10.1016/S0020-0190(00)00223-4.
Dobosiewicz, Wlodzimierz (29 August 1980). "An efficient variation of bubble sort". Information Processing Letters. 11 (1): 5–6. doi:10.1016/0020-0190(80)90022-8.

nist.gov

xlinux.nist.gov

"diminishing increment sort". Retrieved March 9, 2021.
"comb sort". National Institute of Standards and Technology (nist.gov). Retrieved March 9, 2021.

web.archive.org

Lacey, Stephen; Box, Richard (April 1991). "A Fast, Easy Sort: A novel enhancement makes a bubble sort into one of the fastest sorting routines". Hands On. Byte Magazine. Vol. 16, no. 4. pp. 315–318, 320. Archived from the original on 2021-09-27. Entire magazine available at archive.org.