Algorithm 64: Quicksort
Abstract
No abstract available.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The hypothesis induced in the quicksort scenario corresponds to the quicksort algorithm and generalises to lists of arbitrary length and elements not seen in the training examples.
“This hypothesis corresponds to the quicksort algorithm (Hoare, 1961) and generalises to lists of arbitrary length and elements not seen in the training examples.”
From Inductive Logic Programming At 30: A New Introduction (2022) · cites this paper as Hoare, 1961
Cited by
Sorted by citations
Inductive Logic Programming At 30: A New Introduction
Cropper, A., & Dumančić, S. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.13507 · Cited by 83 · see citing works
“This hypothesis corresponds to the quicksort algorithm (Hoare, 1961).”
Method
- Authors
- Hoare, C. A. R.
- Affiliations
- Elliott brothers Ltd., Hertfordshire, England, U.K.
- Corresponding author
- Hoare, C. A. R.
- Venue
- Communications of the ACM
- Published
- 1961-07
- Volume
- 4
- Issue
- 7
- Pages
- 321
- ISSN
- 0001-0782 (ISSN-L)
- 1557-7317
- OpenAlex
- W2082357899
- Cited by
- 537
- References
- 0
- Citations by year
- 2026: 2 · 2025: 11 · 2024: 15 · 2023: 14 · 2022: 16 · 2021: 24 · 2020: 22 · 2019: 21 · 2018: 13 · 2017: 36 · 2016: 29 · 2015: 21 · 2014: 20 · 2013: 24 · 2012: 15
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Communications of the ACM (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Keywords
- quicksort, sorting algorithms, divide-and-conquer
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
