Concepedia

Heapsort

Heapsort is a comparison-based sorting algorithm that belongs to the class of in-place sorting methods, distinguished by its use of a binary heap data structure to iteratively select and extract the maximum (or minimum) element for ordered arrangement.

36

Publications

1.9K

Citations

70

Authors

35

Institutions

Publications per year

2017–2026

6

Parents

Publications

36

Algorithm 232: Heapsort

John W. Williams · Communications of the ACM · 1964 · 471 citations · Full text

, , +10

Heap-based optimizer inspired by corporate rank hierarchy for global optimization

Qamar Askari, Mehreen Saeed, Irfan Younas · Expert Systems with Applications · 2020 · 375 citations

, , +14

The analysis of Quicksort programs

Robert Sedgewick · Acta Informatica · 1977 · 127 citations

, , +12

A linear complexity intersection algorithm for discrete element simulation of arbitrary geometries

John Williams, R. O’Connor · Engineering Computations · 1995 · 127 citations

, , +17

Best sorting algorithm for nearly sorted lists

Curtis R. Cook, Do Jin Kim · Communications of the ACM · 1980 · 107 citations · Full text

, , +11

1–5 of 36

Authors

70

  1. JT
    Jukka Teuhola

    University of Turku, Finland

    3 publications · 119 citations

    3

    h-index

  2. SC
    Svante Carlsson

    Lund University, Sweden

    3 publications · 103 citations

    3

    h-index

  3. LK
    Lukáš Kohútka

    Slovak University of Technology in Bratislava, Slovakia

    2 publications · 26 citations

    2

    h-index

  4. JK
    Jyrki Katajainen

    University of Copenhagen, Denmark

    2 publications · 91 citations

    2

    h-index

  5. GE
    Gary Eddy

    The University of Melbourne, Australia

    2 publications · 39 citations

    2

    h-index

1–5 of 70

Institutions

35

  1. Lund University

    Lund, Sweden

    4 h-index

    4 publications

    131 citations

  2. University of Turku

    Turku, Finland

    3 h-index

    3 publications

    119 citations

  3. TU Dortmund University

    Dortmund, Germany

    3 h-index

    3 publications

    113 citations

  4. The University of Melbourne

    Melbourne, Australia

    2 h-index

    4 publications

    78 citations

  5. Slovak University of Technology in Bratislava

    Bratislava, Slovakia

    2 h-index

    4 publications

    52 citations

  6. University of Copenhagen

    Copenhagen, Denmark

    2 h-index

    5 publications

    208 citations

  7. University of Kassel

    Kassel, Germany

    1 h-index

    1 publications

    28 citations

  8. Warsaw University of Technology

    Warsaw, Poland

    1 h-index

    1 publications

    37 citations

1–8 of 35

Venues

  1. Information Processing Letters

    4 publications · 92 citations

    4

    h-index

  2. Theoretical Computer Science

    3 publications · 129 citations

    3

    h-index

  3. Communications of the ACM

    2 publications · 578 citations

    2

    h-index

  4. Acta Informatica

    2 publications · 146 citations

    2

    h-index

  5. Software Practice and Experience

    2 publications · 39 citations

    2

    h-index

1–5