If you want practice, Algorithm Design, by Jon Kleinberg and Éva Tardos has 200+ problems to design for, with walk through solutions to many of them. The proble

If you want practice, Algorithm Design, by Jon Kleinberg and Éva Tardos has 200+ problems to design for, with walk through solutions to many of them. The problems are all class-tested in homework or exams by students at Cornell. Algorithms: Parallel and Sequential book by Umut A. Acar and Guy E. Blelloch walks through many of the same undergrad algorithmic techniques finding opportunities to split up the work, chap3 walks through genome sequencing methods for example http://www.parallel-algorithms-book.com/ http://www.parallel-algorithms-book.com/ The Design and Analysis of Algorithms, by Dexter Kozen is 40 self contained lectures, introduces theory I didn't read in the other books, and his analysis walk throughs are well written. It's much more definition->lemma->theorem style but if you know set theory and familiar with graphs, trees, DAGs from the CLRS book you can understand most of the lectures.