# Algorithms: heap data structure and intro to Greedy Algorithms

I’m currently taking the Algorithms 1/Algorithms 2 courses on Coursera. This is an aside from pure data viz, but is good to get this part of the core cs foundation. And, it’s fun!

Today’s lectures & main take-away messages

**Heaps as Data Structures:** (1) if you find yourself doing repeated minimum (or maximum) computations, consider a heap and (2) choosing the right data structure can decrease an algorithm’s running time

**Intro to Greedy Algorithms**: (1) Greedy algorithms are one of the major algorithm design paradigms along with divide & conquer, randomized, and dynamic programming. (2) Comparing Greedy to Divide & Conquer, greedy algorithms are generally easier to apply while you need the right insight to find how to decompose for D & C, easier to calculate Big O classification since often one aspect of the algorithm dominates, but typically non-trivial to prove correctness.

**Optimal Caching as an…**

View original post 117 more words

Posted on July 16, 2014, in Programming. Bookmark the permalink. Leave a comment.

## Leave a comment

## Comments 0