Kyle Loudon

Note moyenne : | 0 avis
Ce produit n'a pas encore été évalué. Soyez le premier !
  • O'Reilly

  • Paru le : 05/08/1999
  • Tous vos e-books sur notre application de lecture
  • Téléchargement immédiat
  • Aide au choix numérique
30,99 €
E-book - Multi-format
Vérifier la compatibilité avec vos supports
Avec l'alerte parution, vous recevez un email dès que l'ouvrage est disponible
Votre note
There are many books on data structures and algorithms, and some books containing code for C libraries, but this book gives you a unique combination of theoretical background and working code. In offering robust solutions for everyday programming tasks, Mastering Algorithm C avoids the abstract style of most classic data structures and algorithms texts but still provides all 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 shown in the text. Full source code appears on the accompanying disk. Using an exceptionally clean programming style and writing style, Kyle Loudon shows you how to use such essential data structures as lists, stacks, queues, sets, trees, heaps, priority queues, and graphs. He shows you how to use algorithms for sorting, searching, numerical analysis, data compression, data encryption, common graph problems, and computational geometry.
He also describes the relative efficiency of all implementations. The compression and encryption chapters not only give you working code for reasonably efficient solutions, they explain 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 extendable 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.
    • Pointer manipulation
    • Recursion
    • Analysis of Algorithms
    • Linked Lists
    • Stacks and queues
    • Sets
    • Hash Tables
    • Trees
    • Heaps and priority queues
    • Graphs
    • Sorting and searching
    • Numerical methods
    • Data compression
    • Data encryption
    • Graph algorithms
    • Geometric algorithms.
  • Date de parution : 05/08/1999
  • Editeur : O'Reilly
  • ISBN : 0-596-10343-3
  • EAN : 9780596103439
  • Format : Multi-format
  • Nb. de pages : 560 pages
  • Caractéristiques du format Multi-format
    • Pages : 560
  • Caractéristiques du format PDF
    • Protection num. : pas de protection
  • Caractéristiques du format ePub
    • Protection num. : pas de protection
  • Caractéristiques du format Streaming
    • Protection num. : pas de protection
  • Caractéristiques du format Mobipocket
    • Protection num. : pas de protection

Nos avis clients sur

Avis Trustpilot

MASTERING ALGORITHMS WITH C. Avec une disquette est également présent dans les rayons

Kyle Loudon - .
30,99 €
Decitre utilise des cookies pour vous offrir le meilleur service possible. En continuant votre navigation, vous en acceptez l'utilisation. En savoir plus OK

Ne partez pas tout de suite...

Inscription newsletter