Mastering algorithms with C
by Kyle Loudon and Andy Oram
- 5 Want to read
"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.
Check nearby libraries
Buy this book
Previews available in: English
Subjects
| Edition | Availability |
|---|---|
1
|
zzzz
|
|
2
|
zzzz
|
|
3
|
zzzz
|
4
|
aaaa
|
Book Details
Table of Contents
Edition Notes
"Useful techniques from sorting to encryption"--Cover.
Includes index.
Classifications
The Physical Object
Edition Identifiers
Work Identifiers
Source records
- Scriblio MARC record
- Library of Congress MARC record
- Library of Congress MARC record
- Internet Archive item record
- Internet Archive item record
- Internet Archive item record
- Internet Archive item record
- Better World Books record
- Library of Congress MARC record
- Promise Item
- marc_columbia MARC record
- Harvard University record
Work Description
Theoretically underpins families of basic algorithms, and then presents working C code.
Community Reviews (0)
Lists
Wikipedia citation
×CloseCopy and paste this code into your Wikipedia page. Need help?