| dbo:description
|
- Sortierverfahren (de)
- algorithme de tri (fr)
- ordiga algoritmo (eo)
- ソートのアルゴリズムのひとつ (ja)
- algoritmo di ordinamento (it)
- алгоритм сортировки, являющийся усовершенствованным вариантом сортировки вставками (ru)
- algorytm sortowania (pl)
- in-place comparison sorting algorithm invented by D. Shell (en)
- 排序算法类型 (zh)
|
| dbo:thumbnail
| |
| dbo:wikiPageExternalLink
| |
| dbo:wikiPageWikiLink
| |
| dbp:averageTime
|
- depends on gap sequence (en)
|
| dbp:bestTime
| |
| dbp:caption
|
- Shellsort with gaps 23, 10, 4, 1 in action (en)
|
| dbp:class
| |
| dbp:data
| |
| dbp:date
|
- 2015-03-10 (xsd:date)
- February 2021 (en)
|
| dbp:optimal
| |
| dbp:reason
|
- There's a lot of discussion of divisibility, but I couldn't find this explicitly stated. E.g. p. 289 says "The increment sequences that we have discussed to this point are effective because successive elements are relatively prime. Another family of increment sequences is effective precisely because successive elements are not relatively prime." (en)
|
| dbp:space
|
- О total, O auxiliary (en)
|
| dbp:time
| |
| dbp:title
|
- Animated Sorting Algorithms: Shell Sort (en)
|
| dbp:url
| |
| dbp:wikiPageUsesTemplate
| |
| dct:subject
| |
| gold:hypernym
| |
| rdfs:label
|
- Shellsort (en)
- Shellovo řazení (cs)
- Shellsort (de)
- Ordenamiento Shell (es)
- Tri de Shell (fr)
- シェルソート (ja)
- Shell sort (it)
- 셸 정렬 (ko)
- Shellsort (nl)
- Sortowanie Shella (pl)
- Shell sort (pt)
- Сортировка Шелла (ru)
- Shell sort (sv)
- Сортування Шелла (uk)
- 希尔排序 (zh)
|
| owl:sameAs
| |
| prov:wasDerivedFrom
| |
| foaf:depiction
| |
| foaf:isPrimaryTopicOf
| |
| is dbo:knownFor
of | |
| is dbo:wikiPageDisambiguates
of | |
| is dbo:wikiPageRedirects
of | |
| is dbo:wikiPageWikiLink
of | |
| is dbp:knownFor
of | |
| is foaf:primaryTopic
of | |
.svg){kind=link}
.svg){kind=link}
