Win a copy of Testing JavaScript Applications this week in the HTML Pages with CSS and JavaScript forum!
  • Post Reply Bookmark Topic Watch Topic
  • New Topic
programming forums Java Mobile Certification Databases Caching Books Engineering Micro Controllers OS Languages Paradigms IDEs Build Tools Frameworks Application Servers Open Source This Site Careers Other all forums
this forum made possible by our volunteer staff, including ...
Marshals:
  • Campbell Ritchie
  • Bear Bibeault
  • Ron McLeod
  • Jeanne Boyarsky
  • Paul Clapham
Sheriffs:
  • Tim Cooke
  • Liutauras Vilda
  • Junilu Lacar
Saloon Keepers:
  • Tim Moores
  • Stephan van Hulst
  • Tim Holloway
  • fred rosenberger
  • salvin francis
Bartenders:
  • Piet Souris
  • Frits Walraven
  • Carey Brown

Funny Algorithm Presentation

 
Ranch Hand
Posts: 76
  • Likes 1
  • Mark post as helpful
  • send pies
  • Quote
  • Report post to moderator
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
     
    Sheriff
    Posts: 15813
    264
    Mac Android IntelliJ IDE Eclipse IDE Spring Debian Java Ubuntu Linux
    • Mark post as helpful
    • send pies
    • Quote
    • Report post to moderator
    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).
     
    Rancher
    Posts: 280
    VI Editor C++ Debian
    • Mark post as helpful
    • send pies
    • Quote
    • Report post to moderator
    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.
     
    Rancher
    Posts: 43016
    76
    • Mark post as helpful
    • send pies
    • Quote
    • Report post to moderator
    #24 in the https://coderanch.com/how-to/java/JavaBeginnersFaq may give you some ideas on how to visualize algorithms.
     
    Rancher
    Posts: 1041
    6
    • Mark post as helpful
    • send pies
    • Quote
    • Report post to moderator
    "When in doubt, use brute force"

    Ken Thompson, co-inventor of Unix


    http://dictionary.die.net/brute%20force
     
    I have gone to look for myself. If I should return before I get back, keep me here with this tiny ad:
    Building a Better World in your Backyard by Paul Wheaton and Shawn Klassen-Koop
    https://coderanch.com/wiki/718759/books/Building-World-Backyard-Paul-Wheaton
      Bookmark Topic Watch Topic
    • New Topic