Some important topics are not covered in very great detail. Used twice as a text at Carleton with mixed reviews. B. M. E. Moret and H. D. Shapiro. This is planned as the first volume of a two-volume set. It has a definite combinatorial optimization flavor.
Dynamic programming is a notable omission from the first volume.
R. Neapolitan and K. Naimipour. Foundations of Algorithms. The text for 227 in 2000 and again in 2001. Seems to be a good balance between practical hints and rigorous analysis. C. H. Papadimitriou and K. Steiglitz.