Mastering algorithms with C

Description

Theoretically underpins families of basic algorithms, and then presents working C code.

Description

"Mastering Algorithms with 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.". "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."--BOOK JACKET.

Subjects

Other Editions

• Mastering algorithms with CO'Reilly1999-01-01
• Mastering algorithms with CElectronic resourceO'Reilly1999-01-01
• Mastering Algorithms with CO'Reilly Media, Incorporated1999-01-01
• Mastering Algorithms with CO'Reilly Media, Incorporated1999-01-01