Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence (Q659768)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence |
scientific article |
Statements
Sorting using complete subintervals and the maximum number of runs in a randomly evolving sequence (English)
0 references
24 January 2012
0 references
sorting algorithm
0 references
runs
0 references
priority queues
0 references
sock-sorting
0 references
evolution of random strings
0 references
Brownian motion
0 references
0 references
0 references
0.991612434387207
0 references
0.7489624619483948
0 references
0.7489624619483948
0 references
0.7329118251800537
0 references
0.7238976359367371
0 references
