I might buy the ones Jos mentioned later on because they look like the true meat on this subject. I am a little too basic at this point to be able to absorb the material in those books now and I might be for Gannon's book, too. Gannon's book is the easier of the two though, and I do need to learn it!!
Of course there are lots of other good books around that are very well worth reading,
but, as you already mentioned yourself, a lot of them take a language specific
approach: "yadda-yadda-yadda in C++/Java/C#/whatever". Donald Knuth takes
the language neutral mathematical approach and actually gives your proofs for
the optimality for a huge bunch of algorithms; but maybe you're right and you
should keep it in mind for later so you can enjoy the real "meat" a bit more ;-)
kind regards,
Jos
ps. another really good one is "Design and analysis of Algorithms" by Aho,
Hopcroft and Ullman. It's a second must read for your list. It's all about algorithms,
no language specific stuff in there.