Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Data Structures and Algorithms 1: Sorting and Searching

Data Structures and Algorithms 1: Sorting and Searching

Mehlhorn, K.

Paperback

Series: Monographs in Theoretical Computer Science. an Eatcs, Book 1

General ComputersProgramming

ISBN10: 3642696740
ISBN13: 9783642696749
Publisher: Springer Nature
Published: Dec 8 2011
Pages: 336
Weight: 1.25
Height: 0.74 Width: 6.69 Depth: 9.61
Language: English
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.

Also in

General Computers

View All