Door de ongeziene drukte kan je online bestelling met thuislevering op dit moment iets langer onderweg zijn dan voorzien. Dringend iets nodig? Kies voor afhaling in een winkel met voorraad. Onze winkels ontvangen jou met open armen!

Afhalen na 1 uur in een winkel met voorraad
Gratis thuislevering in België vanaf € 30
Ruim aanbod met 7 miljoen producten

Afhalen na 1 uur in een winkel met voorraad
Gratis thuislevering in België vanaf € 30
Ruim aanbod met 7 miljoen producten

Winkels

Verlanglijstje

Winkels

Verlanglijstje

Zoeken

Lezen

Leren

Geven

Beleven

Jonge gezinnen

Alle producten

E-books

Boekenbon

Promoties

Volg ons op

Wist je dat er in Vlaanderen voor iedereen een Standaard Boekhandel is binnen een straal van 7 km?

Zoek een winkel

€ 53,95

+ 107 punten

Uitvoering

Levering 2 à 3 weken

Eenvoudig bestellen

Veilig betalen

Gratis thuislevering vanaf € 30 (via bpost)

Gratis levering in je Standaard Boekhandel

Omschrijving

This book was written to fill the gap that exists when Computer Science students, and programmers, attempt to learn and analyze the different algorithms that currently exist. I took a course on Algorithms and was disappointed in the type of material that's currently available. There are two types of books that I kept running into:

1). First, the overly complex book. This book seems like it's designed for people that are already fluent in the topics and wanted a more detailed and mathematical approach to algorithms.

2). Second, the overly simple book. A basic introduction to algorithms. This is a high-level overview of some algorithms, and most complex algorithms are not mentioned. After completion, the person is still incapable of showing how the algorithm runs when a problem is presented.

This book is designed for undergraduate upper-class students and programmers that want to expand their horizon. It can be used as a supplementary book alongside the complex book. Readers will gain the knowledge necessary to solve those mathematically intensive algorithmic problems that were presented in the complex book.

Each chapter consists of a brief description of how the algorithm works followed by a detailed example or two. No steps are skipped during the traversal process. The reader is presented with a clear, simplified approach to solving the algorithm that the chapter is dedicated to. Each chapter follows a natural progression from the previous chapter. If certain algorithms rely heavily on prior knowledge, the previous chapter covers that topic. For example, Kruskal's algorithm relies heavily on prior knowledge of Minimum Spanning Trees and Greedy Algorithms. Each of those topics receives a chapter of its own.