Asymptotically fastest sorting algorithm for almost sorted arrays (Q4993799)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7360039
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Asymptotically fastest sorting algorithm for almost sorted arrays |
scientific article; zbMATH DE number 7360039 |
Statements
16 June 2021
0 references
increasing subsequences
0 references
patience sorting algorithm
0 references
worst-case optimality
0 references
0 references
0.7428789734840393
0 references
0.7119282484054565
0 references
0.7110182046890259
0 references
0.7105117440223694
0 references
