Siirry suoraan sisältöön
Advances in Randomized Parallel Computing
Tallenna

Advances in Randomized Parallel Computing

A brief introduction to randomized algorithms In the aflalysis 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( n log n).
Painos
Softcover reprint of the original 1st ed. 1999
ISBN
9781461332848
Kieli
englanti
Paino
310 grammaa
Julkaisupäivä
12.10.2011
Sivumäärä
287