๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Sorting, Selection, and Industry Shakeouts

โœ Scribed by Peter Thompson; Mihaela Pintea

Book ID
106515388
Publisher
Springer US
Year
2008
Tongue
English
Weight
520 KB
Volume
33
Category
Article
ISSN
0889-938X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Introspective Sorting and Selection Algo
Introspective Sorting and Selection Algorithms
โœ DAVID R. MUSSER ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 93 KB

Quicksort is the preferred in-place sorting algorithm in many contexts, since its average computing time on uniformly distributed inputs is ฮ˜(N log N), and it is in fact faster than most other sorting algorithms on most inputs. Its drawback is that its worst-case time bound is ฮ˜(N 2 . Previous attem

Introspective sorting and selection revi
Introspective sorting and selection revisited
โœ John D. Valois ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 221 KB

We describe two improvements to introspective sorting and selection algorithms: a simple rule for finegrained introspection that detects potential worst-case performance after only a small constant number of partitioning steps, and the use of remedial randomization as an intervention strategy in ord

Sorting and Selection in Posets
Sorting and Selection in Posets
โœ Daskalakis, Constantinos; Karp, Richard M.; Mossel, Elchanan; Riesenfeld, Samant ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English โš– 349 KB