Spedizione gratuita per ordini superiori a 69,99 euro.

Controllare lo stato dell'ordine

Entra a far parte di una comunità di amanti dei libri di tutto il mondo e ottieni numerosi vantaggi. Crea un account gratuito

Spedizione gratuita con Packeta per un prezzo superiore a 69.99 €

Bartolini 4.49 € Punto Poste 5.49 € Punto Poste 5.49 € Punto Bartolini 3.49 € DHL 6.99 € GLS 5.99 €

Contatto

Come acquistare

Aiuto

Il mio account

▸ Vuoto :-(

Spedizione gratuita per ordini superiori a 69,99 euro.

Practical Analysis of Algorithms

Name: Practical Analysis of Algorithms
Brand: Springer International Publishing AG
SKU: 05147751
Price: 47.49 EUR
Availability: InStock
Author: Dana Vrajitoru
ISBN: 9783319098876

Dana Vrajitoru

William Knight

Lingua

Inglese

Libro In brossura

Codice Libristo: 05147751

Casa editrice Springer International Publishing AG, settembre 2014

This book introduces the essential concepts of algorithm analysis required by core undergraduate and... Descrizione completa

Codice Libristo: 05147751

116 b

47.49 €

Magazzino esterno Inviamo tra 5-8 giorni

30 giorni per il reso

I clienti hanno acquistato anche

Protocolbuilder Madieyna L. Fall

In brossura

54.99 €

Das Lächeln der Teddybären Tanja Heinze

In brossura

8.59 €

Farbatlas und Lehrbuch der Mundschleimhauterkrankungen Manfred Straßburg

Rigido

128.39 €

This book introduces the essential concepts of algorithm analysis required by core undergraduate and graduate computer science courses, in addition to providing a review of the fundamental mathematical notions necessary to understand these concepts. Features: includes numerous fully-worked examples and step-by-step proofs, assuming no strong mathematical background; describes the foundation of the analysis of algorithms theory in terms of the big-Oh, Omega, and Theta notations; examines recurrence relations; discusses the concepts of basic operation, traditional loop counting, and best case and worst case complexities; reviews various algorithms of a probabilistic nature, and uses elements of probability theory to compute the average complexity of algorithms such as Quicksort; introduces a variety of classical finite graph algorithms, together with an analysis of their complexity; provides an appendix on probability theory, reviewing the major definitions and theorems used in the book.