希尔排序
Sign in to saveAlso known as Shell sort, Shell's method, Shellsort, Shell sort, Shell's method
排序算法类型
Key facts
- Algorithm.class
- Sorting algorithm
- Algorithm.image
- Step-by-step visualisation of Shellsort
- Algorithm.caption
- Shellsort with gaps 23, 10, 4, 1 in action
- Algorithm.data
- Array
- Algorithm.time
- O(n2) (worst known worst case gap sequence)O(n log2n) (best known worst case gap sequence)
- Algorithm.best time
- O(n log n) (most gap sequences)O(n log2n) (best known worst-case gap sequence)
- Algorithm.average time
- depends on gap sequence
- Algorithm.space
- О(n) total, O(1) auxiliary
- Algorithm.optimal
- No
via Wikipedia infobox
Wikidata facts
- Instance of
- comparison sort
- Subclass of
- sorting algorithm
- Image
- Sorting shellsort anim.gif
Show 5 more facts
- time of discovery or invention
- 1959-00-00
- discoverer or inventor
- Donald L. Shell
- Stack Exchange tag
- stackoverflow.com/tags/shellsort
- maintained by WikiProject
- WikiProject Mathematics
Sources (3)
via Wikidata · CC0
Article · 中文
希爾排序（Shellsort），也稱遞減增量排序算法，是插入排序的一種更高效的改進版本。希爾排序是非穩定排序算法。 希爾排序是基於插入排序的以下兩點性質而提出改進方法的： * 插入排序在對幾乎已經排好序的數據操作時，效率高，即可以達到的效率 * 但插入排序一般來說是低效的，因為插入排序每次只能將數據移動一位
Abstract from DBpedia / Wikipedia · CC BY-SA