An adaptive generic sorting algorithm that uses variable partitioning<sup>∗</sup> (Q2710787): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A new measure of presortedness / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Samplesort: A Sampling Approach to Minimal Storage Tree Sorting / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Combinatorics, complexity, and randomness / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4057549 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Measures of Presortedness and Optimal Sorting Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3993214 / rank | |||
Normal rank | |||
Latest revision as of 16:44, 3 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An adaptive generic sorting algorithm that uses variable partitioning<sup>∗</sup> |
scientific article |
Statements
An adaptive generic sorting algorithm that uses variable partitioning<sup>∗</sup> (English)
0 references
19 December 2002
0 references
algorithm esign
0 references
analysis of algorithms
0 references
adaptive sorting
0 references
