This week's book giveaway is in the OCPJP forum. We're giving away four copies of OCA/OCP Java SE 7 Programmer I & II Study Guide and have Kathy Sierra & Bert Bates on-line! See this thread for details.
So for my Algorithms Analysis and Design course, our instructor wants us to put together a visual presentation to review one of any of the topics we have covered in the course thus far. I personally want to put together a funny video but it also has to be educational. I wonder if anyone has any good ideas for a humorous video I could put together for the following topics:
Brute Force with Recursion (Subtopic of Brute Force)
Decrease and Conquer (Decrease by One or by Half)
Divide and Conquer
Transform and Conquer
Memoization or Dynamic Programming
Recurrence Relations/Recursion Tree Method/Amortization
Data Structures and Invariants (How invariants can improve Big-O for certain operations (i.e. AVL Trees)
Graph Algorithms (Dijkstra's or Prim's or Depth/Breadth first search)
Not sure if you are still interested. I met a friend of mine after a long time. He has, between the last time we met and now, completed his PhD in theoretical CS and is now a part time instructor. He told me this anecdote that he used in class to explain the difference between 2SAT (which is in P) and 3SAT (which is in NP). The analogy was with conventional marriage between two people and why God didn't intend for a third person in this picture.
"Perfection is achieved, not when there is nothing more to add, but when there is nothing left to take away." -- Antoine de Saint-Exupery