QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average (Q4981155): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1815168186 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1307.3033 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 21:10, 19 April 2024
scientific article; zbMATH DE number 6307644
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average |
scientific article; zbMATH DE number 6307644 |
Statements
QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average (English)
0 references
24 June 2014
0 references
in-place sorting
0 references
quicksort
0 references
mergesort
0 references
analysis of algorithms
0 references
