I found Algorithms by Cormen et al a very fascinating book filled with an in depth study of computational algorithms. The editorial review by Amazon.com says:
If you had to buy just one text on algorithms, Introduction to Algorithms is a magnificent choice. The book begins by considering the mathematical foundations of the analysis of algorithms and maintains this mathematical rigor throughout the work. The tools developed in these opening sections are then applied to sorting, data structures, graphs, and a variety of selected algorithms including computational geometry, string algorithms, parallel models of computation, fast Fourier transforms (FFTs), and more.
This books strength lies in its encyclopedic range, clear exposition, and powerful analysis.
Pseudo-code explanation of the algorithms coupled with proof of their accuracy makes this book a great resource on the basic tools used to analyze the performance of algorithms.
From Book News, Inc. , October 1, 1990. Both rigorous and complete, this introduction covers traditional material and modern developments: elementary data structures, sorting graph algorithms and NP-completeness are included along with material on Fibonacci heaps, parallel algorithms, network flow algorithms, computational geometry, and number-theoretic algorithms. Annotation copyright Book News, Inc. Portland, Or.
including mine also.