mastering algorithms de loudon (47 résultats)

Paperback. Etat : As New. No Jacket. Pages are clean and are not marred by notes or folds of any kind. ~ ThriftBooks: Read More, Spend Less 1.95.

Paperback. Etat : Good. No Jacket. Former library book; Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.95.

Paperback. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.95.

Paperback. Etat : Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.95.

Paperback. Etat : Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.95.

Paperback. Etat : Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.95.

Paperback. Etat : Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.95.

Paperback. Etat : Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less 1.95.

Etat : Very Good. Used book that is in excellent condition. May show signs of wear or have minor defects.

Etat : good. A good reading copy. May contain markings or be a withdrawn library copy.

Paperback. Etat : Good.

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

Etat : NEW.

Paperback or Softback. Etat : New. Mastering Algorithms with C 2.09. Book.

Etat : New. In.

Etat : New.

Paperback. Etat : New. 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.

Etat : New.

Etat : New. 1999. 1st Edition. Paperback. Offering solutions for everyday programming tasks, this text provides information on the purpose and use of common programming techniques. Implementations and real-world examples of each data structure are shown in the text. Num Pages: 562 pages, 1, black & white illustrations. BIC Classification: UMX. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 233 x 178 x 31. Weight in Grams: 960. . . . . .

Etat : As New. Unread book in perfect condition.

Paperback. Etat : New. 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.

Book. Etat : New. New copy - Usually dispatched within 4 working days. 858.

Etat : New.

Paperback. Etat : New. 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.

Etat : As New. Unread book in perfect condition.

Etat : New. 1999. 1st Edition. Paperback. Offering solutions for everyday programming tasks, this text provides information on the purpose and use of common programming techniques. Implementations and real-world examples of each data structure are shown in the text. Num Pages: 562 pages, 1, black & white illustrations. BIC Classification: UMX. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly; (UU) Undergraduate. Dimension: 233 x 178 x 31. Weight in Grams: 960. . . . . . Books ship from the US and Ireland.

paperback. Etat : New.

Paperback. Etat : New.

Etat : New. Offering solutions for everyday programming tasks, this text provides information on the purpose and use of common programming techniques. Implementations and real-world examples of each data structure are shown in the text.There are many books on data .

Paperback. Etat : New. 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.