Home > Articles

This chapter is from the book

6.5 Suggested Reading

  1. Mastering Algorithms with C, by Kyle Loudon. O’Reilly, 1999. ISBN-13: 978-1-56592-453-6.

    This book provides a practical, down-to-earth introduction to algorithms and data structures using C, covering hash tables, trees, sorting, and searching, among other things.

  2. The Art of Computer Programming, vol. 3: Sorting and Searching, 2nd ed., by Donald E. Knuth. Addison-Wesley, 1998. ISBN-13: 978-0-201-89685-5.

    This book is usually cited as the final word on sorting and searching. Bear in mind that it is considerably denser and harder to read than the Loudon book.

  3. The GTK project10 consists of several libraries that work together. GTK is the underlying toolkit used by the GNU GNOME Project.11 At the base of the library hierarchy is GLib, a library of fundamental types and data structures and functions for working with them. GLib includes facilities for all the basic operations we’ve covered so far in this book, and many more, including linked lists and hash tables. To get started, see GLib’s online documentation.12

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.