4 ms·
If you're looking for a text on algorithms, Sedgewick is probably the friendliest one to someone studying on his own. CLRS and Knuth can be tough sledding, par
by Turing_Machine 5y ago
If you're looking for a text on algorithms, Sedgewick is probably the friendliest one to someone studying on his own.
CLRS and Knuth can be tough sledding, particularly without a knowledgeable mentor or instructor.
- Turing_Machine 5y agoP.S. note that Sedgewick (plus or minus $COAUTHOR) comes in a variety of editions, depending on what language is used for the examples (C, C++, Java...).