The Handbook of Data Structures and Algorithms, by Gonnet and Baeza-Yates [GBY91], provides a comprehensive reference on fundamental data structures for searching and priority queues, and algorithms for sorting and text searching. The book covers this relatively small number of topics comprehensively, presenting most of the major and minor variations that appear in the literature. Perusing the book makes one aware of the tremendous range of data structures that have been developed and the intense level of analysis many of them have been subjected to.
For each data structure or algorithm, a brief description is provided
along with its asymptotic complexity and an extensive set of references.
More distinctively, an implementation in C and/or Pascal is usually
provided, along with experimental results comparing the performance
of these implementations. The programs in [GBY91] are available at a very slick
WWW site, http://www.dcc.uchile.cl/ 
rbaeza/handbook/hbook.html.
Since many of the elementary data structures and sorting algorithms can be implemented concisely, most of the programs are very short. They are perhaps most useful as models, or as part of an experimental study to compare the performance on different data structures for a particular application.