Course: MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Dnatube
share this page with the world.
Lec 1- MIT 6.046J / 18.410J Introduction ...
Lec 1- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Administrivia | Introduction | Analysis of Algorithms, Insertion Sort, Mergesort 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
Lec 2- MIT 6.046J / 18.410J Introduction ...
Lec 2- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Asymptotic Notation | Recurrences | Substitution, Master Method 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
Lec 3- MIT 6.046J / 18.410J Introduction ...
Lec 3- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Divide-and-Conquer: Strassen, Fibonacci, Polynomial Multiplication 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
Lec 4- MIT 6.046J / 18.410J Introduction ...
Lec 4- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Quicksort, Randomized Algorithms 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
Lec 5- MIT 6.046J / 18.410J Introduction ...
Lec 5- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Linear-time Sorting: Lower Bounds, Counting Sort, Radix Sort 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
Lec 6- MIT 6.046J / 18.410J Introduction ...
Lec 6- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Order Statistics, Median 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
Lec 7- MIT 6.046J / 18.410J Introduction ...
Lec 7- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Hashing, Hash Functions 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
Lec 8- MIT 6.046J / 18.410J Introduction ...
Lec 8- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Universal Hashing, Perfect Hashing 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
Lec 9- MIT 6.046J / 18.410J Introduction ...
Lec 9- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Relation of BSTs to Quicksort | Analysis of Random BST 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
Lec 10- MIT 6.046J / 18.410J Introductio ...
Lec 10- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Red-black Trees, Rotations, Insertions, Deletions 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
Lec 11- MIT 6.046J / 18.410J Introductio ...
Lec 11- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Augmenting Data Structures, Dynamic Order Statistics, Interval Trees 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
Lec 12- MIT 6.046J / 18.410J Introductio ...
Lec 12- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Skip Lists 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
Lec 13- MIT 6.046J / 18.410J Introductio ...
Lec 13- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Amortized Algorithms, Table Doubling, Potential Method 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
Lec 14- MIT 6.046J / 18.410J Introductio ...
Lec 14- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Competitive Analysis: Self-organizing Lists 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
Lec 15- MIT 6.046J / 18.410J Introductio ...
Lec 15- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Dynamic Programming, Longest Common Subsequence 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
Lec 16- MIT 6.046J / 18.410J Introductio ...
Lec 16- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Greedy Algorithms, Minimum Spanning Trees 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
Lec 17- MIT 6.046J / 18.410J Introductio ...
Lec 17- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Shortest Paths I: Properties, Dijkstra's Algorithm, Breadth-first Search 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
Lec 18- MIT 6.046J / 18.410J Introductio ...
Lec 18- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Shortest Paths II: Bellman-Ford, Linear Programming, Difference Constraints 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
Lec 19- MIT 6.046J / 18.410J Introductio ...
Lec 19- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005 Shortest Paths III: All-pairs Shortest Paths, Matrix Multiplication, Floyd-Warshall, Johnson 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
Lec 20- MIT 6.046J / 18.410J Introductio ...
Lec 20- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Advanced Topics 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
Lec 21- MIT 6.046J / 18.410J Introductio ...
Lec 21- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. 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
Lec 22- MIT 6.046J / 18.410J Introductio ...
Lec 22- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. 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
Lec 23- MIT 6.046J / 18.410J Introductio ...
Lec 23- MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005. Advanced Topics (cont.) | Discussion of Follow-on Classes 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
MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503),
Source of these courses is MIT
This course teaches techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. 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. This course was also taught as part of the Singapore-MIT Alliance (SMA) progra
MIT Website: http://www.dnatube.com/school/mit
COURSE NAME: MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503),