Tasuta kohaletoimetamine tellimustele üle 29 €
  • check 10+ miljonit raamatut
  • check Uued tooted iga päev
  • check Meid usaldab üle 1 miljoni kliendi
  • check Hea hind ja allahindlused
  • check Tarne üle kogu Euroopa

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

inglise keel
2011-12-08
49,49 € 82,48 €

-40% koodiga BOOKS

Meie tarnija laos

Saadetis 10-16 tööpäeva jooksul

30-päevane tagastamisõigus

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) ... Täielik kirjeldus

Võib-olla meeldib sulle ka

Kirjeldus

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.

Lisateave

Autor K. Mehlhorn
Kirjastaja Springer Berlin Heidelberg
Series Monographs in Theoretical Computer Science. An EATCS Series
Väljalaskeaasta 2011
Kaanetüüp Pehme kaanega
EAN 9783642696749
Kirjuta oma arvustus
Te vaatate: Data Structures and Algorithms 1: Sorting and Searching
Teie hinnang:

Goodreads'i arvustused

49,49 € 82,48 €