They are generally well written and are full of similar "aha's". You could read some standard textbooks on combinatorial optimization, computational geometry, and network flows. I've always assumed this was second nature to everyone before I came across a posting on Hacker News. qualification exams they often include "cool" unpublished results and even extensions to recent papers.ĭo you have a good introduction to that material?Īny algorithms professor? That aside, I honestly don't know. The same goes for homework in graduate algorithms classes (incidentally, there are a few of them on MIT OCW) and Ph.D. Speaking of exercises, I like the ones in most programming contests such as the IOI and the ICPC World Finals as they involve multiple levels of insight and focus on implementation as well. ![]() It's still bad at being anything but being a reference (a really good one) and a repository for exercises. ![]() The 3rd edition makes some good revisions, and it's exhaustive in its exposure. To answer the topic question, I'd say the free book by Dasgupta, Papadimitriou, and Vazirani is a good introduction for everyone with limited or no programming experience. For an interesting collection of tasks, look no further than high school competitions. BFS/DFS/Prim's/Dijkstra's, are fundamentally the same algorithm using different containers that give their corresponding tree structures interesting properties.)Īgain, I'm not impressed with MIT's undergrad algorithms course: it's littered with pointless pedantry and routine problem sets. (Just an example from the top of my head: few CS students realize that all graph traversals, e.g. In fact, most (all?) algorithms textbooks are outdated pedagogically. Example: Hello.Įxplanation of our link flairs Join our /r/bookclub Don't forget /new! Filter by Flair AMA Weekly Thread Mod PostĪma Check out this week's Thread CalendarĪre you a researcher in theoretical computer science or any related field? If so, I'd be interested to see you elaborate on that.Īdmittedly, it's a comprehensive reference but almost everyone in my department's theory group finds it to be a terrible "introduction to algorithms" at any level.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |