Tallenna
Handbook of Randomized Computing
A brief introduction to randomized algorithms In the analysis of algorithms, at least three different measures of performance can be used: the best case, the worst case, and the average case. 2 For instance, the worst case run time of Hoare's quicksort is O(n ), whereas its average case run time is only O(nlogn).
- Alaotsikko
- Volume I/II
- Toimittaja
- Sanguthevar Rajasekaran, Panos M. Pardalos, J.H. Reif, José Rolim
- Painos
- Softcover reprint of the original 1st ed. 2001
- ISBN
- 9781461348863
- Kieli
- englanti
- Paino
- 310 grammaa
- Julkaisupäivä
- 7.12.2013
- Kustantaja
- Springer-Verlag New York Inc.
- Sivumäärä
- 996
