Skip to main content
SpringerLink
Log in

New Results in Minimum-Comparison Sorting

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

We prove that sorting 13, 14 and 22 elements requires 34, 38 and 71 comparisons, respectively. This solves a long-standing problem posed by Knuth in his famous book The Art of Computer Programming, Volume 3, Sorting and Searching. The results are due to an efficient implementation of an algorithm for counting linear extensions of a given partial order. We also present some useful heuristics which allow us to decrease the running time of the implementation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097 Warszawa, Poland

    Marcin Peczarski

Authors
  1. Marcin Peczarski
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marcin Peczarski.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Peczarski, M. New Results in Minimum-Comparison Sorting. Algorithmica 40, 133–145 (2004). https://doi.org/10.1007/s00453-004-1100-7

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-004-1100-7

Search

Navigation