# Visual Presentation Algorithms

William Koch

Ranch Hand

Posts: 76

posted 3 years ago

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. It needs to be primarily visual. Some people in the past have done parodies of past or done a dance of different sorting algorithms. I wonder if anyone has any good ideas for a humorous video/presentation I could put together for the following topics (maybe an everyday occurrence of algorithms we see everyday that many people do not even notice):

IT MUST BE PRIMARILY VISUAL IN NATURE AND I PREFER NOT TO DO POWERPOINT UNLESS YOU HAVE A REALLY GOOD IDEA FOR ONE.

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

IT MUST BE PRIMARILY VISUAL IN NATURE AND I PREFER NOT TO DO POWERPOINT UNLESS YOU HAVE A REALLY GOOD IDEA FOR ONE.

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

Stuart A. Burkett

Ranch Hand

Posts: 679

posted 3 years ago

What was wrong with the suggestion you got the last time you asked this question ?