Lesson 6: Introduction to Algorithms by Mohammad Hajiaghayi: Smart Algorithm Design Strong Inductio
In this session we talk about very efficient algorithms and implementations for the celebrity problem, evaluating a polynomial at a given point, and the maximum consecutive subsequence problem all via strengthening the induction hypothesis technique). #algorithms, #design, #induction, #stronginduction, #strengthening, #evaluating, #polynomial, #celebrity, #celebrityproblem, #maximum, #consecutive, #sequence , #smartdesign, #implementation, #loopinvariant, #geeksforgeeks , #hackerrank, #leetcode, #cs, #computerscience All handwritten and typed notes for this course are available through the website of the instructor at http://www.cs.umd.edu/~hajiagha/ (Just click on the "Introduction to Algorithms" course from the website).
In this session we talk about very efficient algorithms and implementations for the celebrity problem, evaluating a polynomial at a given point, and the maximum consecutive subsequence problem all via strengthening the induction hypothesis technique). #algorithms, #design, #induction, #stronginduction, #strengthening, #evaluating, #polynomial, #celebrity, #celebrityproblem, #maximum, #consecutive, #sequence , #smartdesign, #implementation, #loopinvariant, #geeksforgeeks , #hackerrank, #leetcode, #cs, #computerscience All handwritten and typed notes for this course are available through the website of the instructor at http://www.cs.umd.edu/~hajiagha/ (Just click on the "Introduction to Algorithms" course from the website).