Fundamentals of Computer Algorithms. Computer Science Press, 1978. This is a reasonable text for many of the topics found in the typical algorithms class, but it is weak on analysis and its approach to backtracking is somewhat idiosyncratic and hard to follow. Used in the past at Carleton. Goes well with its companion data structures text.
Recent editions show improvements to the above shortcomings.
J. H. Kingston. Design, Correctness, Analysis. A strong textbook for the elementary undergraduate algorithms course, but the coverage is a little shallow for advanced undergraduates. The chapter on correctness proofs is an unusual but welcome addition. The Art of Computer Programming.