Introduction to Algorithm - First Series
Algorithm is the heart of coding. Master them, then you can code better.
Through OCW, educators improve courses and curricula, making their schools more effective; students find additional resources to help them succeed; and independent learners enrich their lives and use the content to tackle some of our world’s most difficult problems.
Introduction to Algorithm - First SeriesShare
Average Rating 0 of 5 with 0 ratings
Course Description :This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems. The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems.
This course will be delivered by Professor Erik Demaine and Professor Srinivas Devadas from MIT. This is first series from three series at introduction to algorithm.
This lesson is Made for :
You will learn stuff about :
Requirements for this lesson :
Chapter #1 - Algorithmic Thinking
Chapter #2 - Models of Computation
Chapter #3 - Insertion Sort, Merge Sort, Heaps and Heap Sort
Chapter #4 - Binary Search Trees, BST Sort, AVL Trees, and AVL Sort
Chapter #5 - Counting Sort, Radix Sort, Lower Bounds for Sorting
Chapter #6 - Hashing with Chaining