Written with the intermediate to advanced C programmer in mind, Mastering Algorithms with C-nonsense does not give guidance to the most common algorithms needed by real world developers. Top of the book should be concise and C function that is read to all the algorithms presented here, including basics like linked lists, stacks to trees, graphs, and sorting / searching algorithms. Each section ends with questions and answers about the workings of the algorithm, along with references to other algorithms (both in books and from other sources). The authors concentrate on the most useful algorithms available today and not try to cover every available variation. Busy readers will appreciate the intelligent selection - and efficient presentation - used here. There are a number of books on C algorithms, but Master Algorithms with C is one of the most concise and immediately useful -. Richard Dragan Topics covered: Algorithm efficiency, pointer basics, arrays, recursion, Big-O Notation, linked lists, stacks, queues, sets, hash tables, trees and B-trees, searching, stacks and priority queues, graphs, sorting and search algorithms, numerical methods, data compression, Huffman coding, LZ77, data encryption, DES, RSA, graph algorithms, minimum spanning trees, geometric algorithms, and convex hulls.