Du sparer 0% ift. normalprisen Spar 0%

Paperback
2-3 uger
483,95 kr.

Bag om 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).

Vis mere

Sprog:
Engelsk

ISBN:
9781461348863

Forlag:
Springer-Verlag New York Inc.

Indbinding:
Paperback

Sideantal:
996

Udgivet:
7. december 2013

Udgave:
12001

Størrelse:
235x155x56 mm.

Vægt:
1576 g.

Leveringstid: 2-3 uger.
Forventet levering: 2. december 2024

Normalpris

BLACK NOVEMBER
483,95 kr. + Fragt
~~483,95 kr.~~

Medlemspris

433,95 kr.

Prøv i 30 dage for 45 kr.
Herefter fra 79 kr./md. Ingen binding.

Beskrivelse af 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).

Brugerbedømmelser af Handbook of Randomized Computing

Andre købte også..

Find lignende bøger

Bogen Handbook of Randomized Computing findes i følgende kategorier:

Business og læring

Handbook of Randomized Computing - Bog

Beskrivelse af Handbook of Randomized Computing

Brugerbedømmelser af Handbook of Randomized Computing

Gør som tusindvis af andre bogelskere