Recitation 1: Asymptotic Complexity and Peak Finding - MIT 6.006 (Fall 2011)
Lecture covering asymptotic complexity analysis and algorithms for peak finding, part of MIT's Introduction to Algorithms course taught by Victor Costan.
MIT OpenCourseWare
186.0K views • Jan 14, 2013
About this video
MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Victor Costan
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
View the complete course: http://ocw.mit.edu/6-006F11
Instructor: Victor Costan
License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
186.0K
Likes
2.2K
Duration
53:50
Published
Jan 14, 2013
User Reviews
4.5
(37) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.