aspose file tools*
The moose likes Programming Diversions and the fly likes Funny Algorithm Presentation Big Moose Saloon
  Search | Java FAQ | Recent Topics | Flagged Topics | Hot Topics | Zero Replies
Register / Login


Win a copy of Spring in Action this week in the Spring forum!
JavaRanch » Java Forums » Other » Programming Diversions
Bookmark "Funny Algorithm Presentation" Watch "Funny Algorithm Presentation" New topic
Author

Funny Algorithm Presentation

William Koch
Ranch Hand

Joined: Sep 26, 2012
Posts: 76
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
  • 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
  • Greedy Algorithms
  • Recurrence Relations/Recursion Tree Method/Amortization
  • Binary Search
  • 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)


  • Please offer some suggestions if you can.

    Thanks,

    Will
    Junilu Lacar
    Bartender

    Joined: Feb 26, 2001
    Posts: 4742
        
        7

    Brute Force, definitely. Take your pick of vikings, cave men, or rugby players -- and there would be buxom women involved as well, ala Benny Hill (just writing his name makes me chuckle).


    Junilu - [How to Ask Questions] [How to Answer Questions]
    Anand Hariharan
    Rancher

    Joined: Aug 22, 2006
    Posts: 257

    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
    Ulf Dittmer
    Marshal

    Joined: Mar 22, 2005
    Posts: 42277
        
      64
    #24 in the https://www.coderanch.com/how-to/java/JavaBeginnersFaq may give you some ideas on how to visualize algorithms.


    Ping & DNS - my free Android networking tools app
    Ivan Jozsef Balazs
    Rancher

    Joined: May 22, 2012
    Posts: 867
        
        5
    "When in doubt, use brute force"

    Ken Thompson, co-inventor of Unix


    http://dictionary.die.net/brute%20force
     
    Don't get me started about those stupid light bulbs.
     
    subject: Funny Algorithm Presentation