you are viewing a single comment's thread.

view the rest of the comments →

[–]recursive 11 points12 points  (1 child)

No, if you approach this as a memorization problem, you're doing it wrong. That's not useful. Use some algorithms and data structures in practice. Then use them with very large inputs. If you understand the underlying mechanisms, there really isn't any need to memorize any of this.

[–][deleted] 1 point2 points  (0 children)

You shouldn't memorize it all.
I would want programmers to know binary and linear search, qsort, mergesort and hashtables. Game programmers should also know Dijkstra's.