Cliquer sur une vignette pour aller sur Google Books.
Chargement... Fundamentals of Data Structures in Cpar Ellis Horowitz, Susan Anderson-Freed, Sartaj Sahni
Aucun Chargement...
Inscrivez-vous à LibraryThing pour découvrir si vous aimerez ce livre Actuellement, il n'y a pas de discussions au sujet de ce livre. In the context "Example 1.8: Program 1.11 also add a list of numbers, but this time the summation is handled recursively. This means that the [[compiler]] must save the parameters, the local variables, and the return address for each recursive call." , does the "compiler" means "computer"? aucune critique | ajouter une critique
Designed to function as a textbook or as a professional reference, Fundamentals of Data Structures in C provides in-depth coverage of all aspects of data structure implementation in ANSI C. The book goes beyond the standard fare of stacks, queues, and lists to offer such features as afull chapter on search structures and a discussion of advanced tree structures. Recent data structure innovations rarelv found in other texts are presented, including Fibonacci Heaps, Splay Trees, Red-Black Trees, 2-3 Trees, 2-3-4 Trees, Leftist Trees, Binokcal Heaps, Min-Max Heaps, and Deaps. Aucune description trouvée dans une bibliothèque |
Discussion en coursAucun
Google Books — Chargement... GenresClassification décimale de Melvil (CDD)005.133Information Computing and Information Computer programming, programs, data, security Programming Languages General Programming LanguagesClassification de la Bibliothèque du CongrèsÉvaluationMoyenne:
Est-ce vous ?Devenez un(e) auteur LibraryThing. |