Bezmaksas piegāde pasūtījumiem virs 29€

  • check 10+ miljoni grāmatu
  • check Jaunumi katru dienu
  • check Vairāk nekā 1 miljons klientu mums uzticas
  • check Labas cenas un atlaides
  • check Piegāde visā Eiropā

Data Structures and Algorithms 1: Sorting and Searching - K. Mehlhorn

angļu valoda
2011-12-08
53,99 € 89,98 €

-40% ar kodu BOOKS

Piegādātāja noliktavā

Piegāde 10-16 darba dienu laikā

30 dienu atgriešanas politika

The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of "algorithm" is central in computer science, and "efficiency" is central in the world of money. I have organized the material in three volumes and nine chapters. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) ... Pilns apraksts

Jums varētu patikt arī

Aprašymas

The design and analysis of data structures and efficient algorithms has gained considerable importance in recent years. The concept of "algorithm" is central in computer science, and "efficiency" is central in the world of money. I have organized the material in three volumes and nine chapters. Vol. 1: Sorting and Searching (chapters I to III) Vol. 2: Graph Algorithms and NP-completeness (chapters IV to VI) Vol. 3: Multi-dimensional Searching and Computational G- metry (chapters VII and VIII) Volumes 2 and 3 have volume 1 as a common basis but are indepen­ dent from each other. Most of volumes 2 and 3 can be understood without knowing volume 1 in detail. A general kowledge of algorith­ mic principles as laid out in chapter 1 or in many other books on algorithms and data structures suffices for most parts of volumes 2 and 3. The specific prerequisites for volumes 2 and 3 are listed in the prefaces to these volumes. In all three volumes we present and analyse many important efficient algorithms for the fundamental computa­ tional problems in the area. Efficiency is measured by the running time on a realistic model of a computing machine which we present in chapter I. Most of the algorithms presented are very recent inven­ tions; after all computer science is a very young field. There are hardly any theorems in this book which are older than 20 years and at least fifty percent of the material is younger than 10 years.

Vairāk informācijas

Autors K. Mehlhorn
Izdevējs Springer Berlin Heidelberg
Series Monographs in Theoretical Computer Science. An EATCS Series
Izlaides gads 2011
Vāka tips Mīkstais vāks
EAN 9783642696749
Rakstiet savu atsauksmi
Jūs vērtējat: Data Structures and Algorithms 1: Sorting and Searching
Jūsu novērtējums:

Goodreads atsauksmes

53,99 € 89,98 €