We may earn an affiliate commission when you visit our partners.
Sriram Sankaranarayanan
Read more
Enroll now

Share

Help others find this collection page by sharing it with your friends and followers:

What's inside

Three courses

Trees and Graphs: Basics

(46 hours)
Basic algorithms on tree data structures, binary search trees, self-balancing trees, graph data structures, and basic traversal algorithms on graphs.

Algorithms for Searching, Sorting, and Indexing

(46 hours)
This course covers basics of algorithm design and analysis, as well as algorithms for sorting arrays, data structures such as priority queues, and applications such as Bloom filters.

Dynamic Programming, Greedy Algorithms

(46 hours)
This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems.

Save this collection

Create your own learning path. Save this collection to your list so you can find it easily later.
Save
Our mission

OpenCourser helps millions of learners each year. People visit us to learn workspace skills, ace their exams, and nurture their curiosity.

Our extensive catalog contains over 50,000 courses and twice as many books. Browse by search, by topic, or even by career interests. We'll match you to the right resources quickly.

Find this site helpful? Tell a friend about us.

Affiliate disclosure

We're supported by our community of learners. When you purchase or subscribe to courses and programs or purchase books, we may earn a commission from our partners.

Your purchases help us maintain our catalog and keep our servers humming without ads.

Thank you for supporting OpenCourser.

© 2016 - 2025 OpenCourser