Mastering Algorithms with C
Format
Book
Språk
Engelska
Antal sidor
560
Utgivningsdatum
1999-04-01
Upplaga
1 x 400pp book (232 x 178mm) & 1 x computer disk.
Förlag
O'Reilly Media, Inc, USA
Illustratör/Fotograf
TabUÜbers Mit Abb
Illustrationer
1, black & white illustrations
Dimensioner
230 x 180 x 30 mm
Vikt
940 g
Antal komponenter
1
Komponenter
with diskette
ISBN
9781565924536
Mastering Algorithms with C

Mastering Algorithms with C

Useful Techniques from Sorting to Encryption.

(1 röst)
Book Engelska, 1999-04-01
299
Skickas inom 5-8 vardagar.
Fri frakt inom Sverige för privatpersoner.
Finns även som
Visa alla 2 format & utgåvor
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
Visa hela texten

Passar bra ihop

  1. Mastering Algorithms with C
  2. +
  3. Algorithms

De som köpt den här boken har ofta också köpt Algorithms av Sanjoy Dasgupta (häftad).

Köp båda 2 för 648 kr

Kundrecensioner

Recensioner i media

'This is an O'Reilly book, surely one of the best publishers of technical books areound. I love 'em, from the animal cover to the Colophon, and it is rare indeed that I come across an O'Reilly book that I regret buying....So, all in all, an enjoyable book and one I will move onto my Important Algorithm Book shelf, rather than on the floor in a pile with the also-rans. Recommended.' - Julian M Bucknall Developers Review, August 2000

Bloggat om Mastering Algorithms with C

Övrig information

Kyle Loudon is a software engineer at Jeppesen Dataplan in Los Gatos, California, where he leads the graphical interface development group in developing flight planning software used by commercial airlines, corporate flight departments, and other facets of general aviation. Before Jeppesen, Kyle worked as a system programmer for IBM. Kyle's technical interests at this time include operating systems, networking, and human-computer interaction. Kyle attended Purdue University, where in 1992 he received a B.S. in computer science and a minor in French, and was elected to Phi Beta Kappa. While at Purdue, he coordinated and taught a course for three years in the Department of Computer Science. During this time he also wrote his first book, Understanding Computers, a practical and conceptual introduction to computers. Currently he is patiently pursuing an advanced degree while continuing to work in Silicon Valley's software industry. Aside from computers, Kyle has enjoyed playing and teaching tennis for a number of years. He also enjoys mountain biking, skiing, and on occasion, golf with friends on courses that favor a sometimes overactive slice. In addition, Kyle enjoys various forms of theater, great food, and several styles of music and art as a wishful but hopeless pianist and artist himself. Kyle found his present position at Jeppesen after he started flying airplanes in 1992. Currently he is an active pilot holding a commercial pilot certificate with the FAA.

Innehållsförteckning

Preface. I. Preliminaries 1. Introduction An Introduction to Data Structures An Introduction to Algorithms A Bit About Software Engineering How to Use This Book. 2. Pointer Manipulation Pointer Fundamentals Storage Allocation Aggregates and Pointer Arithmetic Pointers as Parameters to Functions Generic Pointers and Casts Function Pointers Questions and Answers Related Topics. 3. Recursion Basic Recursion Tail Recursion Questions and Answers Related Topics. 4. Analysis of Algorithms Worst-Case Analysis O-Notation Computational Complexity Analysis Example: Insertion Sort Questions and Answers Related Topics. II. Data Structures. 5. Linked Lists Description of Linked Lists Interface for Linked Lists Implementation and Analysis of Linked Lists Linked List Example: Frame Management Description of Doubly-Linked Lists Interface for Doubly-Linked Lists Implementation and Analysis of Doubly Linked Lists Description of Circular Lists Interface for Circular Lists Implementation and Analysis of Circular Lists Circular List Example: Second-Chance Page Replacement Questions and Answers Related Topics. 6. Stacks and Queues Description of Stacks Interface for Stacks Implementation and Analysis of Stacks Description of Queues Interface for Queues Implementation and Analysis of Queues Queue Example: Event Handling Questions and Answers Related Topics. 7. Sets Description of Sets Interface for Sets Implementation and Analysis of Sets Set Example: Set Covering Questions and Answers Related Topics. 8. Hash Tables Description of Chained Hash Tables Interface for Chained Hash Tables Implementation and Analysis of Chained Hash Tables Chained Hash Table Example: Symbol Tables Description of Open-Addressed Hash Tables Interface for Open-Addressed Hash Tables Implementation and Analysis of Open Addressed Hash Tables Questions and Answers Related Topics. 9. Trees Description of Binary Trees Interface for Binary Trees Implementation and Analysis of Binary Trees Binary Tree Example: Expression Processing Description of Binary Search Trees Interface for Binary Search Trees Implementation and Analysis of Binary Search Trees Questions and Answers Related Topics. 10. Heaps and Priority Queues Description of Heaps Interface for Heaps Implementation and Analysis of Heaps Description of Priority Queues Interface for Priority Queues Implementation and Analysis of Priority Queues Priority Queue Example: Parcel Sorting Questions and Answers Related Topics. 11. Graphs Description of Graphs Interface for Graphs Implementation and Analysis of Graphs Graph Example: Counting Network Hops Graph Example: Topological Sorting Questions and Answers Related Topics. III. Algorithms. 12. Sorting and Searching Description of Insertion Sort Interface for Insertion Sort Implementation and Analysis of Insertion Sort Description of Quicksort Interface for Quicksort Implementation and Analysis of Quicksort Quicksort Example: Directory Listings Description of Merge Sort Interface for Merge Sort Implementation and Analysis of Merge Sort Description of Counting Sort Interface for Counting Sort Implementation and Analysis of Counting Sort Description of Radix Sort Interface for Radix Sort Implementation and Analysis of Radix Sort Description of Binary Search Interface for Binary Search Implementation and Analysis of Binary Search Binary Search Example: Spell Checking Questions and Answers Related Topics. 13. Numerical Methods Description of Polynomial Interpolation Interface for Polynomial Interpolation Implementation and Analysis of Polynomial Interpolation Description of Least-Squares Estimation Interface for Least-Squares Estimation Implementation and Analysis of Least-Squares Estimation Description of the Solution of Equations Interface for the Solution of Equations Implementation and Analysis of the Solution of Equations Questions and Answers Related To