Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Check order status

Become part of a community of book lovers from all over the world and get access to a whole bunch of benefits. Create an account for free

Free delivery for purchases over 19 990 Ft

DPD courier 1 190 Ft Hungarian Post 1 795 Ft Hungarian Post 1 690 Ft Hungarian Post 1 690 Ft FoxPost 1 190 Ft Packeta point 1 190 Ft DPD point 990 Ft GLS courier 1 690 Ft GLS point 1 190 Ft

Contact

How to shop

Help

My account

▸ Empty :-(

Free shipping on orders over 19,990 Ft via Packeta, Fox Post Box, and DPD Collection Point

Practical Analysis of Algorithms

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

Dana Vrajitoru

William Knight

Language

English

Book Paperback

Libristo code: 05147751

Publishers Springer International Publishing AG, September 2014

This book introduces the essential concepts of algorithm analysis required by core undergraduate and... Full description

Libristo code: 05147751

120 b

17 438 Ft

In stock at our supplier Shipping in 5-8 days

Up to 30 days for returns

Customers also purchased

Protocolbuilder Madieyna L. Fall

Paperback

20 261 Ft

Das Lächeln der Teddybären Tanja Heinze

Paperback

3 172 Ft

Farbatlas und Lehrbuch der Mundschleimhauterkrankungen Manfred Straßburg

Hardback

47 261 Ft

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.