Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
Lec 23 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005
Play lesson

MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), - Lec 23 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005

Master Algorithm Design with MIT's Foundational Course

5.0 (1)
8 learners

What you'll learn

Analyze algorithm efficiency using asymptotic notation
Apply divide-and-conquer strategies to solve problems
Implement and analyze fundamental graph algorithms
Design algorithms using dynamic programming and greedy techniques

This course includes

  • 30 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Full Transcript

Lecture 23: Advanced Topics (cont.) View the complete course at: http://ocw.mit.edu/6-046JF05 License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere