Concepedia

Quicksort

Quicksort is a divide-and-conquer sorting algorithm that recursively partitions an unsorted array around a pivot element, rearranging elements such that those less than the pivot precede those greater than the pivot, and applying the same process to the resulting subarrays until the entire array is sorted.

116

Publications

6.4K

Citations

190

Authors

114

Institutions

Publications per year

2017–2026

7

Variants

Quick Sort

Parents

Publications

116

1–5 of 116

Authors

190

  1. RN
    Ralph Neininger

    Goethe University Frankfurt, Germany

    6 publications · 239 citations

    6

    h-index

  2. RS
    Robert Sedgewick

    Brown University, United States

    4 publications · 872 citations

    4

    h-index

  3. HP
    Helmut Prodinger

    TU Wien, Austria

    3 publications · 87 citations

    3

    h-index

  4. HH
    Hsien‐Kuei Hwang

    Institute of Statistical Science, Academia Sinica, Taiwan

    3 publications · 178 citations

    3

    h-index

  5. CM
    Conrado Martı́nez

    Universitat Politècnica de Catalunya, Spain

    3 publications · 113 citations

    3

    h-index

1–5 of 190

Institutions

114

  1. Carnegie Mellon University

    Pittsburgh, United States

    5 h-index

    9 publications

    540 citations

  2. Universitat Politècnica de Catalunya

    Barcelona, Spain

    4 h-index

    5 publications

    247 citations

  3. University of Maryland, College Park

    College Park, United States

    3 h-index

    4 publications

    300 citations

  4. Chalmers University of Technology

    Gothenburg, Sweden

    3 h-index

    6 publications

    440 citations

  5. Goethe University Frankfurt

    Frankfurt am Main, Germany

    3 h-index

    3 publications

    56 citations

  6. Brown University

    Providence, United States

    3 h-index

    4 publications

    505 citations

  7. Johns Hopkins University

    Baltimore, United States

    3 h-index

    3 publications

    93 citations

  8. University of Jordan

    Amman, Jordan

    3 h-index

    6 publications

    114 citations

1–8 of 114

Venues

  1. Communications of the ACM

    10 publications · 1.1K citations

    10

    h-index

  2. Random Structures and Algorithms

    8 publications · 301 citations

    8

    h-index

  3. ACM Journal of Experimental Algorithmics

    JEA · 6 publications · 288 citations

    6

    h-index

  4. RAIRO - Theoretical Informatics and Applications

    ITA · 5 publications · 506 citations

    5

    h-index

  5. Software Practice and Experience

    5 publications · 109 citations

    5

    h-index

1–5