shellsort
in-place comparison sorting algorithm invented by D. Shell
Facts
10 properties- Instance of
- sorting algorithm, in-place algorithm, comparison sort[3][4]
- Subclass of
- sorting algorithm[5]
- Average time complexity
- O(n^{1.25})
- Best-case time complexity
- O (n \log n)
- Defining formula
- W_{v}(s + 1) = W_{v}(s) + \theta(u, v, s) \cdot \alpha(s) \cdot (D(t) - W_{v}(s))
- Discoverer or inventor
- Donald L. Shell[2]
- Time of discovery or invention
- 1959[6]
- Worst-case space complexity
- O(1)
- Worst-case time complexity
- O(n^2)
🏷️ Also known as
en Shell's method
en shellsort
en Shell sort
en Shellsort, Shell sort, Shell's method
ar خوارزمية شل للترتيب
cs Shellovo řazení
da Shellsortering
es Ordenamiento Shell
es Ordenacion Shell
es Ordenación Shell
es Shell Sort
fa الگوریتم shell sort
fa الگوریتم مرتب سازی شل
fa مرتبسازی شل
fa مرتب سازی شل
fa مرتب سازی شل-متزنر
fi kuorilajittelu
fr Tri de Shell
he מיון של
ja シェルソート
🔖 Identifiers · 9
- Dictionary of Algorithms and Data Structures ID
- shellsortI
- Encyclopedia of China (Third Edition) ID (2026)
- 1ZogrA
- Encyclopedia of China (Third Edition) old ID (2021)
- 375969
- Freebase ID
- /m/0k8m7
- MathWorld ID
- Shellsort
- Microsoft Academic ID (discontinued)
- 105089967
- Quora topic ID
- Shell-Sort-1, Shellsort
- Rosetta Code page ID
- Sorting_algorithms/Shell_sort
- Stack Exchange tag
- stackoverflow.com
🔗 Connections
Instance of 3
Discoverer or inventor 1
Maintained by WikiProject 1
Subclass of 1
Uses 1
Press Enter · cited answer in seconds
0 sources
Summary
shellsort is a sorting algorithm[1].