World Mentoring Academy "An Open Community for Successful Learning"

Free World class mobile education, earn a Bachelors for less than $5,000 books & Test Fees from State Universities, using Experiential, Design & Project based education. Supporting credit-by-exam & Challenging University courses.

Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial-Share Alike 4.0 International License.
Expand/collapse block About & Angel Club


$365 given 2017 Join this project

Help $29 in treasury 

 
Expand/collapse block Login
Login
Password
Keep me logged in
 
Expand/collapse block Selected courses
-
 
Expand/collapse block Information for lesson "Introduction to Algorithms 6.046J / 18.410J MIT"
Description: Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; greedy algorithms; amortized analysis; graph algorithms; and shortest paths. Advanced topics may include network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.
Language: English
Professors: Javier Thayer, Michael Williams
Units: 23
Lesson content
Enroll Enroll