@prefix p: <http://www.wikidata.org/prop/> .
@prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#> .
@prefix schema1: <http://schema.org/> .
@prefix skos: <http://www.w3.org/2004/02/skos/core#> .
@prefix wd: <http://www.wikidata.org/entity/> .
@prefix wds: <http://www.wikidata.org/entity/statement/> .
@prefix wdt: <http://www.wikidata.org/prop/direct/> .
@prefix wdtn: <http://www.wikidata.org/prop/direct-normalized/> .
@prefix wikibase: <http://wikiba.se/ontology#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

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