I second that - that book is very good. Algorithms are of such a general nature that you shouldn't have problems translating them from pseudo-code (which is how most such books -including Cormen/Leiserson- present algorithms) into any language you happen to be using.
If it were specific to one language -say, Java- you might end up scratching your head, saying: why is he implementing a sorting algorithm, when he could just use Collections.sort?
I can recommend Data Structures and Algorithms in Java (2nd Edition) by Robert Lafore. It covers loads of different data structures and sorting/searching algorithms in detail. It does not cover the exact classes in the Java Collections framework, but it does cover all the collection types included in that framework (and more), and provides the full Java source code of their custom implementations. The same is true for the various sorting and searching algorithms. I found it to be an excellent book, which applicability transcends Java.
Build a man a fire, and he'll be warm for a day. Set a man on fire, and he'll be warm for the rest of his life.