Könyv Mastering Algorithms with C Kyle Loudon

Mastering Algorithms with C

Szerző: Kyle Loudon
Nyelv: Angol
Kötés: Puha kötésű
Kiadó: O'Reilly Media
Elérhetőség: Beszállítói készleten
Küldés 9-13 napon belül
18 125 Ft
Kézbesítjük karácsonyig
There are many books on data structures and algorithms, including some with useful libraries of C fu...

Információk a könyvről

Szerző
Nyelv
Angol
Kötés
Könyv - Puha kötésű
Kiadva
1999
oldal
560
EAN
9781565924536
ISBN
1565924533
Enbook ID
04231129
Súly
950
Méretek
178 x 233 x 31

Teljes leírás

There are many books on data structures and algorithms, including some with useful libraries of C functions. Mastering Algorithms with C offers you a unique combination of theoretical background and working code. With robust solutions for everyday programming tasks, this book avoids the abstract style of most classic data structures and algorithms texts, but still provides all of the information you need to understand the purpose and use of common programming techniques. Implementations, as well as interesting, real-world examples of each data structure and algorithm, are included. Using both a programming style and a writing style that are exceptionally clean, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He explains how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry. And he describes the relative efficiency of all implementations. The compression and encryption chapters not only give you working code for reasonably efficient solutions, they offer explanations of concepts in an approachable manner for people who never have had the time or expertise to study them in depth. Anyone with a basic understanding of the C language can use this book. In order to provide maintainable and extendible code, an extra level of abstraction (such as pointers to functions) is used in examples where appropriate. Understanding that these techniques may be unfamiliar to some programmers, Loudon explains them clearly in the introductory chapters. Contents include: * Pointers * Recursion * Analysis of algorithms * Data structures (lists, stacks, queues, sets, hash tables, trees, heaps, priority queues, graphs) * Sorting and searching * Numerical methods * Data compression * Data encryption * Graph algorithms * Geometric algorithms

Érdekelheti

15 174 Ft
24 022 Ft

Extreme C

Kamran Amini
22 102 Ft
13 705 Ft
27 250 Ft

Learning Algorithms

George Heineman
24 022 Ft
21 056 Ft
25 018 Ft

Fluent C

Christopher Preschern
19 885 Ft

C++ in Embedded Systems

Amar Mahmutbegović
15 407 Ft

Numerical Python

Robert Johansson
10 739 Ft

Algorithms C++

hu yang hu
18 285 Ft
27 765 Ft

AI Engineering

Chip Huyen
24 022 Ft
24 596 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

16 097 Ft

Effective C

Robert C. Seacord
14 337 Ft

Modern C

Jens Gustedt
23 142 Ft
21 056 Ft

Advanced Topics in C

Noel Kalicharan
24 022 Ft
26 035 Ft

C Programming Language

Brian W. Kernighan
21 251 Ft
18 125 Ft

bash Cookbook 2e

Carl Albing
17 857 Ft
19 593 Ft
22 850 Ft

Numerical C

Philip Joyce
15 174 Ft
18 125 Ft

Pointers in C

Hrishikesh Dewan
22 699 Ft
25 607 Ft

Bootstrap

Jake Spurlock
8 333 Ft
9 860 Ft