Mastering Algorithms with C

Loudon, Kyle

ISBN 10: 1565924533 / ISBN 13: 9781565924536

Edité par O'Reilly, Beijing, Cambridge, Farnham, 1999

A propos de cet article

540 S., beil. eine 3,5'' Diskette, Kt., Gr. 8° (23,5 cm), Benutzerstempel auf Schmutztitel Sprache: eng.

N° de réf. du vendeur 11055

Détails bibliographiques

• Titre: Mastering Algorithms with C
• Éditeur: O'Reilly, Beijing, Cambridge, Farnham
• Date de parution: 1999
• Langue: anglais
• ISBN à 10 chiffres: 1565924533
• ISBN à 13 chiffres: 9781565924536
• Reliure: kartoniert
• État de l'article: guter Zustand
• Catalogues du vendeur:
  • Naturwissenschaft und Technik

A propos de ce titre

Synopsis

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

À propos de l?auteur

Kyle Loudon is a software engineer at Matrix Semiconductor in Santa Clara, California, where he works with file systems and applications for memory chips. Prior to Matrix, Kyle developed platform software for embedded devices, including various wireless phones and the Apple iPod. He also led the graphical user interface group at Jeppesen Dataplan (now a part of Boeing), developed flight planning software, and created system software at IBM in the early 1990s. For the past several years, Kyle has taught object-oriented programming using C++ at the University of California, Santa Cruz Extension, and has worked with C++ since the beginning of its widespread use in 1990. Kyle is the author of Mastering Algorithms with C, also published by O'Reilly and Associates.