Wow

Algorithms class is phenomenal.  It is completely (and unexpectedly) different from undergraduate algorithms.  Each day, the professor presents us with a single problem, that seems deceptively simple, but takes hours and hours to think about! For example, he posed problems on finding a sorting algorithm and on finding a path-finding algorithm.  In undergraduate, we dealt with sorting and path-finding algorithms, so we automatically recollect what we had learned about them.  However, that information is totally useless for these new problems.  For example, he asked us to find an algorithm that will take an arbitrary graph and a method G(x,y) that returns whether an edge exists between any two vertices in that path, and asked us to write a method P(x,y) that will return whether or not a path exists between any two vertices, and that consumes O(logn) of memory for an n-vertex graph. Neat, eh? :-)