comb sort
sorting algorithm
Facts
5 properties- Instance of
- sorting algorithm
- Best-case time complexity
- O(n \log n)
- Worst-case space complexity
- O(1)
- Worst-case time complexity
- O(n^2)
🏷️ Also known as
en comb sort
ar ترتيب المشط
de Combsort
fa مرتبسازی شانهای
fa مرتب سازی شانه ای
fr comb sort
fr tri à peigne
fr Tri Combsort
fr tri de Dobosiewicz
he מיון מסרק
hu fésűs rendezés
ja コムソート
ja Comb sort
ja コームソート
ja 櫛ソート
ko 빗질 정렬
pl Comb sort
pl Combsort
pl sortowanie grzebieniowe
pt Classificação Pente
🔖 Identifiers · 5
- Image (Wikimedia Commons)
- Comb sort demo.gif ↗
- Dictionary of Algorithms and Data Structures ID
- combSort
- Freebase ID
- /m/015102
- Microsoft Academic ID (discontinued)
- 35804436
- Rosetta Code page ID
- Sorting_algorithms/Comb_sort
🔗 Connections
Instance of 1
Uses 1
← FactGrid item ID 1
Press Enter · cited answer in seconds
0 sources
Summary
comb sort is a sorting algorithm[1].