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.
🔥 Related Trending Topics
LIVE TRENDSThis video may be related to current global trending topics. Click any trend to explore more videos about what's hot right now!
THIS VIDEO IS TRENDING!
This video is currently trending in Pakistan under the topic 'f'.
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
Video Information
Views
186.0K
Total views since publication
Likes
2.2K
User likes and reactions
Duration
53:50
Video length
Published
Jan 14, 2013
Release date
Quality
sd
Video definition
Captions
Available
Subtitles enabled
About the Channel
Tags and Topics
This video is tagged with the following topics. Click any tag to explore more related content and discover similar videos:
Tags help categorize content and make it easier to find related videos. Browse our collection to discover more content in these categories.