|
rdfs:label
|
"Haugsortering"@nb
"Heapsort"@de
"Heapsort"@et
"Heapsort"@hy
"Heapsort"@lb
"Heapsort"@sv
"Hrúguröðun"@is
"Kekolajittelu"@fi
"Krūvos rikiavimo algoritmas"@lt
"Kupacrendezés"@hu
"Qalaq sıralaması"@az
"Sắp xếp vun đống"@vi
"Urejanje s kopico"@sl
"Yığın sıralaması"@tr
"amasa ordigo"@eo
"heapsort"@ca
"heapsort"@en
"heapsort"@es
"heapsort"@it
"heapsort"@nl
"heapsort"@pt
"sortiranje stablom"@sr-el
"sortowanie przez kopcowanie"@pl
"tri par tas"@fr
"řazení haldou"@cs
"Пирамидално сортиране"@bg
"пирамидальная сортировка"@ru
"пірамідальне сортування"@uk
"сортирање стаблом"@sr
"сортирање стаблом"@sr-ec
"מיון ערימה"@he
"تصنيف الكومة"@ar
"مرتبسازی هرمی"@fa
"हीप सॉर्ट"@hi
"হিপ সর্ট"@bn
"ഹീപ് സോർട്ട്"@ml
"ฮีปซอร์ต"@th
"ヒープソート"@ja
"堆排序"@zh
"堆排序"@zh-cn
"堆排序"@zh-hans
"堆排序"@zh-hk
"堆排序"@zh-sg
"堆積排序"@zh-hant
"堆積排序"@zh-tw
"힙 정렬"@ko
|
|
skos:altLabel
|
"Haldensortierung"@de
"Heap Sort"@de
"Heap sort"@ml
"Heap sort"@pt
"Heap sort"@vi
"Heap-Sort"@de
"Heapsort"@pl
"Heapsort"@ru
"Heapsort"@vi
"Krūvos algoritmas"@lt
"Krūvos rūšiavimo algoritmas"@lt
"Urejanje z izboljšanim izbiranjem"@sl
"Vun đống"@vi
"haldové třídění"@cs
"heap sort"@cs
"heap sort"@es
"heap sort"@it
"heapsort"@cs
"heapsort"@fr
"ordenamiento por monticulos"@es
"ordenamiento por montículos"@es
"الگوریتم مرتب سازی هرمی"@fa
"مرتب سازی دودویی"@fa
"مرتب سازی هرمی"@fa
"ഹീപ്പ് സോർട്ട്"@ml
"堆積排序"@zh
"히프 소트"@ko
"히프 정렬"@ko
"힙 소트"@ko
"힙소트"@ko
|
|
schema:description
|
"Sortierverfahren"@de
"Zortéieralgorithmus"@lb
"algorithme de tri"@fr
"algoritmo di ordinamento per heap"@it
"worst-case optimal in-place comparison sorting algorithm based on the heap data structure"@en
"řadicí algoritmus"@cs
"алгоритм сортировки"@ru
"हीप डेटा संरचना पर आधारित सबसे खराब स्थिति में इष्टतम इन-प्लेस तुलना सॉर्टिंग एल्गोरिदम"@hi
|
|
schema:dateModified
|
"2026-09-08T18:08:38+00:00"^^xsd:dateTime
|
|
schema:version
|
2542394618
|
|
wikibase:identifiers
|
8
|
|
wikibase:sitelinks
|
39
|
|
wikibase:statements
|
22
|
|
p:P18
|
wd:statement/Q474095-5514A4AC-FC80-43E5-96E9-144E35EDBBF4
|
|
wd:statement/Q474095-cd4b1844-450f-74f6-1111-48ce1142097e
|
|
p:P2283
|
wd:statement/Q474095-824BF036-2400-48B3-925C-5460B9A3AD88
|
|
p:P2812
|
wd:statement/Q474095-6ba6cd0f-4d23-ff70-10f5-4f1a08e92051
|
|
p:P31
|
wd:statement/Q474095-06c11666-4f0c-0e5d-1838-144c8d0fa5c4
|
|
wd:statement/Q474095-44988D10-FFE7-4846-AB84-124FBD5CF7B9
|
|
p:P373
|
wd:statement/q474095-69533BFB-C347-4BD8-A024-7F22A9CD7451
|
|
p:P3752
|
wd:statement/Q474095-04487f0c-498e-d400-90c5-aefb6f83643b
|
|
p:P3753
|
wd:statement/Q474095-88763c73-41e9-7c14-d533-6dcd5acb0356
|
|
p:P3754
|
wd:statement/Q474095-bfa4c460-47a7-a25b-b4b1-3834d5c74ab8
|
|
p:P3755
|
wd:statement/Q474095-d16025e0-4129-64a2-64c9-5bda5bca7a27
|
|
p:P4969
|
wd:statement/Q474095-0C6E0467-555C-4D46-AC61-CEEB8E8CE1A3
|
|
p:P5047
|
wd:statement/Q474095-08f87e5b-4ba5-c031-ab2f-42f6e630605c
|
|
p:P5106
|
wd:statement/Q474095-0b6637c8-488d-e59d-a37f-3e14e168c488
|
|
wd:statement/Q474095-9E0BC526-45C8-4648-8053-AC6A4F21396E
|
|
p:P575
|
wd:statement/Q474095-3130e830-438c-968b-3391-bf613bd67ffc
|
|
p:P61
|
wd:statement/Q474095-fa59a73e-485b-f295-0efc-cf168f8f9924
|
|
p:P6104
|
wd:statement/Q474095-B37A57B9-2F81-45DD-8483-A15230532A59
|
|
p:P6366
|
wd:statement/Q474095-E6CE46CD-96F5-4517-B926-4C17700AD993
|
|
p:P646
|
wd:statement/Q474095-9B31425D-0A84-4586-859D-5CFA2AB20048
|
|
p:P6564
|
wd:statement/Q474095-ac71e806-45c5-8724-d711-375609a2c4d2
|
|
p:P7726
|
wd:statement/Q474095-1967290f-4a05-230a-2196-3a62c579f75a
|
|
p:direct-normalized/P6366
|
<https://makg.org/entity/55201436>
|
|
wdt:P18
|
<http://commons.wikimedia.org/wiki/Special:FilePath/Binary%20heap%20bottomup%20vs%20topdown.svg>
|
|
<http://commons.wikimedia.org/wiki/Special:FilePath/Sorting%20heapsort%20anim.gif>
|
|
wdt:P2283
|
array data structure
|
|
wdt:P2812
|
"Heapsort"
|
|
wdt:P31
|
sorting algorithm
|
|
comparison sort
|
|
wdt:P373
|
"Heap sort"
|
|
wdt:P3752
|
"<math class="mwe-math-element mwe-math-element-inline" xmlns="http://www.w3.org/1998/Math/MathML"><mrow data-mjx-texclass="ORD"><mstyle displaystyle="true" scriptlevel="0"><mi>O</mi><mo stretchy="false">(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo><mo stretchy="false">)</mo></mstyle></mrow></math>"^^http://www.w3.org/1998/Math/MathML
|
|
wdt:P3753
|
"<math class="mwe-math-element mwe-math-element-inline" xmlns="http://www.w3.org/1998/Math/MathML"><mrow data-mjx-texclass="ORD"><mstyle displaystyle="true" scriptlevel="0"><mi>O</mi><mo stretchy="false">(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo><mo stretchy="false">)</mo></mstyle></mrow></math>"^^http://www.w3.org/1998/Math/MathML
|
|
wdt:P3754
|
"<math class="mwe-math-element mwe-math-element-inline" xmlns="http://www.w3.org/1998/Math/MathML"><mrow data-mjx-texclass="ORD"><mstyle displaystyle="true" scriptlevel="0"><mi>O</mi><mo stretchy="false">(</mo><mi>n</mi><mi>log</mi><mo>⁡</mo><mo stretchy="false">(</mo><mi>n</mi><mo stretchy="false">)</mo><mo stretchy="false">)</mo></mstyle></mrow></math>"^^http://www.w3.org/1998/Math/MathML
|
|
wdt:P3755
|
"<math class="mwe-math-element mwe-math-element-inline" xmlns="http://www.w3.org/1998/Math/MathML"><mrow data-mjx-texclass="ORD"><mstyle displaystyle="true" scriptlevel="0"><mi>O</mi><mo stretchy="false">(</mo><mn>1</mn><mo stretchy="false">)</mo></mstyle></mrow></math>"^^http://www.w3.org/1998/Math/MathML
|
|
wdt:P4969
|
smoothsort
|
|
wdt:P5047
|
"Sorting_algorithms/Heapsort"
|
|
wdt:P5106
|
"heapSort"
|
|
"heapSortI"
|
|
wdt:P575
|
"1964-01-01T00:00:00+00:00"^^xsd:dateTime
|
|
wdt:P61
|
J. W. J. Williams
|
|
wdt:P6104
|
WikiProject Mathematics
|
|
wdt:P6366
|
"55201436"
|
|
wdt:P646
|
"/m/03mwc"
|
|
wdt:P6564
|
"heap-sort"
|
|
wdt:P7726
|
"Heapsort"
|