Selection via the bogo-method -- more on the analysis of perversely awful randomized algorithms

DOI10.4230/LIPICS.FUN.2018.23zbMATH Open1489.68400MaRDI QIDQ3301012FDOQ3301012

Authors: Markus Holzer, Jan-Tobias Maurer 

Publication date: 11 August 2020

Recommendations

• Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms
• scientific article; zbMATH DE number 1857638
• Randomized selection in \(n+C+o(n)\) comparisons
• Randomized algorithms and pseudorandom numbers
• A select and insert sorting algorithm

zbMATH Keywords

selectionbogo-methodcombinatorial sums and series

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Randomized algorithms (68W20) Analysis of algorithms (68W40) Searching and sorting (68P10)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Interesting Series Involving the Central Binomial Coefficient
• Sums of reciprocals of the central binomial coefficients
• Title not available (Why is that?)
• Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms

Cited In (2)

• Title not available (Why is that?)
• Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms

This page was built for publication: Selection via the bogo-method -- more on the analysis of perversely awful randomized algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3301012)