The writing style is superb, and the code is very clean. This code is easy to update, and adaptable to a variety of situations. When one studies data structures and algorithms, a fair amount of time is sent proving their correctness.
Mathematical rigor appears only to the extent necessary in explanation.
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. 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.