A few of my students in CS 124 (Algorithms and Data Structures) pointed me to this xkcd cartoon -- amused, no doubt, that we had covered the O(2^n n^2) algorithms in class about a week ago. And who says that you don't learn anything important in my class!
David Eppstein was inspired to write a longer blog post on the algorithm, well worth reading (especially if you're in my class!).
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment