Home »Computer Science »MIT OCW » Introduction to Algorithms

Introduction to Algorithms

Lecture 1: Introduction - Analysis of Algorithms, Insertion Sort, Mergesort

Add to Favorite
You must be logged in to add to favorites.     Log In  Close
No Transcript Download:   No Download Available 1757 views

Course Description :

Topics covered include: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.

Other Resources :

Handouts | Citation |

Licensed under a Creative Commons License by MIT OCW

 

Other Computer Science Courses

 

Comments

No Comments Available.

Post your Comments

 
Captcha