Lecture 1: Algorithmic Thinking, Peak Finding

MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course: ocw.mit.edu/6-006F11
Instructor: Srini Devadas
License: Creative Commons BY-NC-SA
More information at ocw.mit.edu/terms
More courses at ocw.mit.edu

[@bkboggy]

It's so cool that these top schools release courses like this one online free of charge. I may not get a chance to go to MIT or Stanford, but I'm sure as heck going to learn as much as I can from them. Thanks!

[@ATXpert]

sellout

[@SpaghettiToaster]

MIT gets billions of government funding. Billions.

[@QQTrick1QQ]

I paid for my MIT education in cash!

[@vertigo6982]

Its like real life.. you can go in most big university classes, sit down and learn for free... (as long as there's an open seat)

[@danielj9865]

ATXpert sellout because hes sharing knowledge?

[@vertigo6982]

MIT Tuition is $49,892/yr $24,946 /per semester which is about $4,989.20 per course. Semester runs 15 weeks. So that equals to about $332.61 per week.. I'd say this course runs twice a week, so this day of class cost $166.30, and you got it for free. Now that's what it cost.. what it's worth is much more. Moral of the story. Be thankful to have such information at our fingertips. FREE MIT courses on Algorithms?!? How awesome is that!?

[@blasttrash]

True, but just to point out, that $166 also includes the ability to talk with peers, professors, teaching assistants etc. It might also include the usage a cluster or supercomputer that MIT runs. And such free education is only good for some courses like Computer Science or theory knowledge in most of the other disciplines. For example, if you are learning electronics, you can get free theory knowledge from such videos, but you wont get any practical knowledge about soldering or circuit design etc coz you would need real hardware. Same applies with biology etc. However, we should indeed be grateful for such videos.

[@dingoDogMan]

@@blasttrash It's worth noting that students are also paying this money for a qualification and proof for potential employers that they possess all of this knowledge.

[@slackerengi2401]

Goodwill hunting A library card goes a long way

[@slackerengi2401]

@@blasttrash EE student here, bought components, soldering iron, and multimeter on Amazon Saw free lectures on KZbin and instructables Knowing what the knobs on a osciliscope do before touching it is great, most in my class had no clue(Myself included) But ultimatly expirience of any kind is king, especially self taught You may not have a supercomputer, but you defenitly got the knoledge and will to learn Some in those classes don't even have that

[@blasttrash]

@@slackerengi2401 True its all about will. I am from ECE too, although I graduated long back and I dont even know how to solder stuff. I can barely remember the difference between series and parallel connections on a bread board. I work in CS field now, so all is good I guess. :)

[@samyakjain7300]

"Inefficient but correct is definitely better than being efficient but incorrect" - Srini Devdas

[@marcospark2803]

Pretty obvious.

[@Daniel_WR_Hart]

"Move fast and break things." - The Zuck

[@Pedro-zh6kk]

the mantra of cryptograph and information security in general

[@lordratix6899]

"but it works" -literally every programmer

[@aidenrichard2898]

What if the cameraman started learning from this lecture and finds himself becoming a programmer :)

[@rintrah81]

He’s already programmed a robot to do the camera work.

[@mirtuzzamitthi4755]

MIT president is the cameraman.

[@rachakondaeshwar4129]

Yep

[@patrickalegria7620]

Or the janitor.

[@dwightpeters]

Nothing wrong with being a cameraman. If you imagine a world with only programmers, it would be awful

[@elizabethphillips1496]

I failed math in high school and over 20 years later actually enjoyed watching and learning from this. I’ve been interested in algorithms and appreciate MIT sharing this class session.

[@PHlophe]

girl you are not alone. but i am thinking its because its now that you can understand what you can do with mathematics. in our days we were taught math and physics like robots. We had to shove everything inside that head or get whippings.

[@mastershooter64]

@@PHlophe ngl it's still taught like that

[@deanmason7160]

@@mastershooter64 this is a straightforward Algorithm

[@jeffschlarb4965]

endless supply ...Stanford, Berkeley, CMU, Cal Tech and Harvard ...machine learning, AI....

[@notagain3732]

Math is something one can learn at any age , yes it can be difficult but with propper material this challenge we call education can become simple when all the steps are clear and at any given time the next step is obvious . Join a community online , that is much better than self learning by its self

[@TrendingPoonai]

Learning a course after a lecture feels like I'm into college, Thank you so much MIT for all your open source curriculum 😊🙏🙏🙏

[@fgfanta]

This is still the best on-line introductory course for algorithms I am aware of. Coupled with programming exercises, it would make legendary content for MITx and edX.

[@KrutikaPatil0109]

Really grateful to MIT and Srini for making this course accessible through OCW... Really enjoyed this course

[@akainu3668]

Alongside this course what did you follow to master ds, algo?

[@KrutikaPatil0109]

CLRS

[@bat_man1138]

Was it worth??i mean whole course

[@juanmoscoso9573]

@@KrutikaPatil0109 you read all of it?

[@ramansarabha871]

@@juanmoscoso9573 I doubt that. She did Andrew Ng's deeplearning specialization, was familiar was supervised, unsupervised and semi-supervised learning from work.

[@mauricemaeterlinck8799]

It feels like this Professor is very passionate and knowledgeable about the course material! The hour flew by

[@obicaban1269]

set playback at higher than 1x... flies by even faster ;P

[@jeffschlarb4965]

Try Harvard CS 50

[@harv609]

@@jeffschlarb4965 that's a foundational course, this one's lil more advanced than that

[@jeffschlarb4965]

@@harv609 I was speaking in regards to a passionate teaching style...

[@harv609]

@@jeffschlarb4965 oh I see, yeah. I agree

[@jaisuriyar5259]

Keep it up MIT ....it's such a nice job to give lectures from excellent professors in online for completely free.....THANKS

[@shubhamrauniyar101]

Thanks MIT for the course. I can now understand things very easily as a correspondence student, it's very hard to understand things, but MIT open course-ware has made life and learning very easy.

[@arindam1249]

Honestly, the best lesson I've ever watched! MIT is the best for a reason! I'd never hesitate to dive right into MIT OCW by this time.

[@bikeshregmi946]

I really feel like I am at MIT and having a live Lecture. Thank You, MIT

[@emo_nemo]

The lecture starts at <a href="#" class="seekto" data-time="22">0:22</a>. Course overview : <a href="#" class="seekto" data-time="171">2:51</a> Course content : <a href="#" class="seekto" data-time="517">8:37</a> First problem (Peak finder) : <a href="#" class="seekto" data-time="931">15:31</a> "Straight forward" algorithm : <a href="#" class="seekto" data-time="1133">18:53</a> "Divide & Conquer" (a recursive) algorithm : <a href="#" class="seekto" data-time="1662">27:42</a> Second problem (2D Peak finder) : <a href="#" class="seekto" data-time="2176">36:16</a> Greedy Ascent algorithm : <a href="#" class="seekto" data-time="2250">37:30</a> "Divide & Conquer 2D" algorithm (defunct) : <a href="#" class="seekto" data-time="2560">42:40</a> "A working 2D recursive" algorithm : <a href="#" class="seekto" data-time="2855">47:35</a>

[@akshaybhatt8332]

bro could plz suggest me the best data structure video channel...i'm a begineer

[@grahamcraqqa]

You're awesome

[@Lens_lores]

doing god's work

[@BULLSHXTYT]

Wow I love you bro.

[@player1coding958]

Where's my fucking son?

[@mlynskey2]

Great lecture. I'm looking forward to the rest of the series!

[@DentrifixoRam88]

Watching this video from Argentina and I think it's amazing and great you guys share this w/ the community. Thanks!!

[@svellene]

I like how the chalk is soft ^_^

[@vantalk2021]

svellene Lol Lol ASMR*

[@jordanmoorman5024]

Jill Talk literally listening to this for asmr but multitasking to get some of that brain power going too.

[@dharmadhikariatharva]

MIT

[@Cognitoman]

bitch I didnt ask

[@nands4410]

MIT

[@RushabhShahclwarrior]

I just wish i had find this earlier in my career, but back then I was not ready to understand how blessed I am to access this. MIT is dream but I can access such courses at my fingertips now!!

[@encrypt3dbr0k3r]

Thank you MIT for uploading this content. Its truly a blessing and you are doing a good service to our planet Earth.

[@jurgenblick5491]

I am so glad that I found this. Been interested Algorithms for a long while.

[@mmkvhornet7522]

Wow what a course !! the professor makes it so easy to understand algorithms thank you MIT !

[@TheNitroPython]

So much knowledge in just an introduction course, love it.

[@WhiskeredBope]

I LOVE how the teacher handles the syllabus!

[@thepianist7379]

No bullshit, no cheap jokes. Just pure joy of knowledge. How college courses should be taught!

[@rkirmizi]

This channel is a gold mine. I'm so happy about finding this :D Thank you very much.

[@sharadrajput379]

This channel is a goldmine. Great information

[@JohnnyDoeDoeDoe]

I felt smarter after watching just the course overview, excited to watch the entire series!

[@aashish77]

Hey

[@hosea_br]

@Deonex replying to a 7 y/o comment xdd

[@danid1464]

Hello, how are you after 7 years?

[@JohnnyDoeDoeDoe]

@@danid1464 I'm a full on software engineer! Did an internship at Microsoft and have been working at startups which interest me since then

[@user-zv7yb4yp9g]

@@JohnnyDoeDoeDoe man, this gives me hope for the future. I'm wondering, did you go to a university?

[@pranki2254]

this is wonderful. Not having to depend on incomplete resources across the internet and then coming across the complete course taught by the BEST is wonderful. Please do put more such courses and help those students who can't afford to have a quality education for one or the other reason, thank you

[@sudipsarkar1512]

Is it a complete DSA course??

[@janmichaelaustria620]

I remember taking an intro to Algos class as an undergraduate way back when. And I remember not having the slightest idea how to get O(logN) for the peak finding problem. And then just being in total shock when some student from the back answered it the first day, like at @<a href="#" class="seekto" data-time="1492">24:52</a>, thinking that kid was the next Dijkstra or Primm lol. I'm now in my 30's grinding away at leetcode and reading CLRS for interviews. And now that I think about it, that kid at @<a href="#" class="seekto" data-time="1492">24:52</a>, was already doing what I'm doing now well before he even took the class. Start while you're really young!

[@utkarsh_108]

do you think in long term software engineer role is good considering the dynamic nature of job scenario

[@Wereld03]

@@utkarsh_108 software engineering as in dumb code, probably not. But there will always be a need for people that can solve problems and put that into code as a tool or final product

[@ViktorKishankov]

The array there is not necessary sorted, so binary search doesn’t seem like a valid approach. Did I miss something?

[@Everspy]

​@@ViktorKishankov All you need to do is find ANY peak in the array. The search starts in the middle, if the value is rising to the left, there must a peak somewhere on the left, same for the right. Otherwise, you must already be on a peak. Imagine you were on a mountain looking for a peak, you would head in the direction where you have to walk uphill. Binary search works because it is any peak, not the greatest peak.

[@premgarg5534]

Don't worry about peak finding algo. If u r confused about binary vs random for 1d peak finding or global peak vs relative one, just learn that this video is for introduction and give students with non programming background a feel of algorithms and a little of divide & conquer. Hope u watch the whole playlist and i can assure you there are no such confusions in later videos! Thanks MIT for the amazing playlist

[@das6109]

I feel really dumb about this problem. I don't understand how it's log(n). I figure you need to check around you on both sides to know if you're a peak. But also you can't eliminate more elements than the ones directly around you as potential peaks because the array is unsorted. How are we cutting potential solutions in half on every check? I've understood some DSA concepts, but even this first class just left me confused lol. Edit: Ah I misunderstood the problem. We're looking for any peak not the highest number. We know that if a number is higher we can jump into the middle of that side of the array and if the number to our left is higher than there must be a peak between the one we started with and the one we just chose. If the number on the right is higher instead we just keep cutting through. Worst case scenario the numbers just increase constantly in one direction and we eventually find the only peak on the extreme right of or left of the array.

[@oneowone6928]

@@das6109 That was exactly my concern lol, from first go it looks like we may skip a peak on the side we're skipping, but seems like if A >= B, then there is a guaranteed peak on side which includes A :)

[@PeterReginald]

Prerequisites A firm grasp of Python and a solid background in discrete mathematics are necessary prerequisites to this course. You are expected to have mastered the material presented in 6.01 Introduction to EECS I and 6.042J Mathematics for Computer Science. If you have not taken and been successful in each of these subjects, please speak with a TA or professor before enrolling. We do allow students who have equivalent, other experience with the material described above to enroll, but with the firm understanding that mastery of this material is assumed and that course staff will not feel obligated to cover it or to help students who are struggling with it. 6.006 is a 12-unit (4-0-8) subject and serves as a Foundational Computer Science subject under the new curriculum. It is a direct prerequisite for 6.046 Design and Analysis of Algorithms, the theory header.

[@BoredChinese]

Wait so I won't learn anything if I only know C?

[@PeterReginald]

Bored Chinese Even though this class uses Python you could still learn something. Really depends on your ability to grasp and apply the lessons to the C language.

[@sandeeprmohanty123]

Hi Could you please provide the link or direct to proper links for the prerequisite courses. I searched in ocw.mit site but there are 4 courses(Spring 2005/2010 and Fall 2005/2010) with 6.042J as title.

[@ibrahimadeniji2286]

Peter Reginald thanks

[@derollo3]

Hello, I wanted to ask If I focus on Java programming and I would like to have a better grasp of algorithms and data structures, in order to help me in Programming, is this course appropriate for that or should I look for something different ? Thank you.

[@anupamdubey5736]

One of those best initiatives I have ever come across. It would create monopoly in the Indian market over all ed-tech platforms and offline coaching tuitions. Only a matter of awareness. Never heard a negative review about this.

[@aghileslounis]

What a time to be alive for having such high quality course for free, free education is the best thing that can happen to humans, learn from each other for free, i understand it's difficult to have free education or anything really, because those people need to be payed to live also, but if we can find a way to have as much free education as possible it's just incredible and highly valuable for humanity, and MIT are doing a great job by contributing to this project/idea, thank you

[@apanapane]

Great lecturer. Thank you, professor.

[@JuanHernandezV]

I always dreamed on going to MIT... and now I can do it from home. Thank you :)

[@lggood8375]

Thanks for featuring this class. I need to know algorithms for my current computer programming learning in Python, Artificial Intelligence etc. I listen to these classes to reinforce my current knowledge.

[@ouaremoualid4883]

It is very awesome that we can follow a great courses from great institutions like MIT for free .

[@beginfatlossDOTcom]

Thank you MIT for sharing this.

[@wireboard6175]

Thank you MIT for sharing videos! They are incredibly useful.

[@actualprogramming]

best time to be alive, you can study from best teacher across the world for free at home.

[@lifeviz28568]

looking at this course after taking design and analysis of algorithms course as a senior this fall 2021 semester with my university. hopefully watching this video helps solidify the concepts learnt.

[@matthewgale1176]

What a comforting teacher... Very clear and straight remarks The questions of life are very import We will find how defaults defaults are l8fe

[@4cricket24]

Great initiative by MIT. I never imagined i will be able to sit and learn from an MIT professor for free!! 👍 എല്ലാ മലയാളികൾക്കും എന്റെ ഹായ്

[@amalfrancis4846]

from kannur......

[@joeljose182]

@@amalfrancis4846 njanum kannur

[@joeljose182]

@@amalfrancis4846 evideya

[@Marendra-Nodi]

Kottayam

[@svs4305]

puthenvelikara

[@falsacuenta5939]

<a href="#" class="seekto" data-time="22">0:22</a>: 🎓 Professors introduce the course 6.006 - Introduction to Algorithms and encourage students to visit the website for more information. <a href="#" class="seekto" data-time="374">6:14</a>: ⚙ The video discusses the use and augmentation of classic data structures and algorithms for efficiency in problem-solving. <a href="#" class="seekto" data-time="746">12:26</a>: 🎲 The video discusses a module on numerics, including graph problems and shortest paths, with a focus on Rubik's cube assignment and finding the shortest path from Caltech to MIT. <a href="#" class="seekto" data-time="1119">18:39</a>: 📚 The video discusses building a sophisticated algorithm and characterizing its complexity in relation to the number of inputs. <a href="#" class="seekto" data-time="1464">24:24</a>: ⏰ The video discusses improving the asymptotic complexity of a one dimensional peak finder algorithm through a binary search subset approach. <a href="#" class="seekto" data-time="1748">29:08</a>: ⬆ The video explains a step-by-step process for identifying peaks in a problem. <a href="#" class="seekto" data-time="2127">35:27</a>: ⬆ The video discusses the difference between theta n and theta logn in terms of complexity, and introduces the 2D version of peak finding. <a href="#" class="seekto" data-time="2507">41:47</a>: ⚙ The video discusses implementing divide and conquer strategy for finding a 2D peak using binary search algorithm. <a href="#" class="seekto" data-time="2869">47:49</a>: 📈 The video discusses finding the global maximum in a 2D array and determining 2D peaks. Recapped using Tammy AI

[@giwrgosnikolaidis1096]

I actually passed the equivalent course to my university by watching these videos. I also scored an almost perfect score! These videos are a goldmine! Thanks a lot for providing these courses to the general public.

[@annapatata6258]

se poio panepisthmeio

[@giwrgosnikolaidis1096]

@@annapatata6258 Μετσόβιο

[@annapatata6258]

@@giwrgosnikolaidis1096 etsii kai egw ekei eimai

[@giwrgosnikolaidis1096]

@@annapatata6258 odws? Ara h hmmy h semfe eisai. Opws kai na exei bohthane full. Egw me auta ta video perasa algorithmous.

[@annapatata6258]

@@giwrgosnikolaidis1096 hmmy eimai 1o etos

[@JeremyVisser]

Excellent camera work. Wish this camera guy could film all lectures -- he handles the lecturer's walking really well.

[@ryanchiang9587]

computer science undergrad major core courses: calculus, linear algebra, discrete mathematics, data structure, assembly language, operating systems, and algorithm,...etc.

[@keshavjha9835]

once you get it, that moment will make your day.

[@AshutoshShelkeP]

I cried. Just visit the link in description and see how wonderfully everything is arranged for us to learn. Thank you team MIT. I cannot explain what this means to a student like me from small indian village. It's a dream come true. Best gift for life.

[@anarghanayak8586]

hey bro i have just learned all the basic and important things on java..can you suggest me from where i can study and concepts of dsa..plz help me i am about to sit on my college placements

[@ANDROHACKS]

@@anarghanayak8586 kzbin.info/aero/PLUl4u3cNGP6317WaSNfmCvGym2ucw3oGp

[@jasminetea4574]

xd

[@kingnand90]

8 modules in this course: 1. Algorithmic thinking: Peak finder 2. Sorting and trees: Event simulation 3. Hashing: Genome comparison 4. Numerics: RSA encryption 5. Graphs: Rubik cube 6. Shortest path 7. Dynamic programming: Image compression 8. Advanced topic

[@wontpower]

I seriously envy the professors at MIT. The profs at my university can't hold a candle to their organization and ability to simplify difficult concepts.

[@synthesizedsimurgh2127]

My uni professors make simple concepts more difficult, what's worse is that they do it with confidence.

[@yacko633]

Thank you for this learningful class, you can explain the problems very clear in the algorithms

[@meikandanathann921]

I really appreciate this free of cost content, because people who were not much concerning about their academics during their college days also get a chance to revisit(of course I am not speaking about MIT alumni)

[@kritgrover3716]

Just finished 6.0001 and 6.042J, now starting 6.006, just as a head start before I join university next year. Really grateful to MIT to provide these lectures for free.

[@giannizamora7247]

you will have a great understanding already going into uni. Good luck on your studies. I wish I had dived into these courses when I started my programming journey.

[@aishwaryadharmadhikari7165]

I'll do those 2 first you did, they seem pretty good. Thanks for commenting man !

[@kritgrover3716]

@@aishwaryadharmadhikari7165 yup they are very helpful and infact they are the prerequisites for this course.

[@dejidevi3990]

@krit grover could you please share the link of 6.0001 and6.042J,and 6.006 ,pizzazz It would be a great help for others, plzzz share

[@dejidevi3990]

@Aishwariya dharmadhikari plzzz provide all the link

[@naraendrareddy273]

I feel like the content of MIT and lower ranked institutes is the same. The difference is in the students and the delivery of the explanations.

[@theaveragegamer1719]

Thankyou Srini Devdas.

[@syd6358]

<a href="#" class="seekto" data-time="930">15:30</a> specific problem -peak finder <a href="#" class="seekto" data-time="1690">28:10</a> divide conquer algorithm <a href="#" class="seekto" data-time="2070">34:30</a> how usefulness depends on size of input data <a href="#" class="seekto" data-time="2175">36:15</a> peak for 2d

[@jonsnow9246]

All these students are the ones who say they did not study for exam and still top the class.

[@SoumilSahu]

Well, to be fair, you don't have to study FOR the exam to ace it. You just have to study period and that's what they do

[@joeyGalileoHotto]

Doubt it, MIT courses are hard as hell

[@alphaco3868]

@@joeyGalileoHotto MIT courses are quite easy....But our UN****** education system quite hard(Deep fact).

[@mohammedjassim9250]

@@alphaco3868 Can I rely on this course to learn data structures and algorithms I mean we are in 2020 and this videos are before 7 years

[@alphaco3868]

@@mohammedjassim9250 Yes you can...I recently watched this lecture __kzbin.info/www/bejne/gIHcpntqpr1_kJI This lecture is about algorithm analysis. Our professors also used this technique. You understand what i'm taking about. If you complete algorithm and data structure from here & understand concept fully. I'm sure you'll find it very helpful no doubt. They also provided textbook that is available for free(.pdf)

[@NORTE_559]

I have absolutely no clue what he's talking about but yet I'm here listening like I'm really trying to learn it .

[@abraiyan7984]

Spend some time on a Basic Data Structure course. It will make sense then.

[@yojodingy6334]

Awesome! Please go try to get attention somewhere else then please!

[@Thisisnotmyrealname8]

@@yojodingy6334 Can you please explain what an algorithm is?

[@yojodingy6334]

@@Thisisnotmyrealname8 no thanks, watch the video

[@abhishekpanthi6496]

@@yojodingy6334 hey!! stop acting Smart and try to get a life please!!

[@TheLeoPoint]

now this is called real work Complet guidance from cyclomatics complexity , just root work , great sir 🔥👌

[@user-gl9ue9gt4s]

Классный канал, от подачи не устаёшь

[@hansolo7988]

Wow, there's 47 of these. I love the internet :3

[@unhappywig]

i swear youtube recommended me this. i was only looking for how to spell mathematics.

[@gmanrock445kolos]

In depth knowledge at its BEST

[@impaler42]

This is a gem of a course

[@butifarra61]

it is free and I thank you...

[@HuseyinKaanKoyukan]

Unfortunately not.. You have to pay the online tuition fee to this bank account 32423545464566

[@balipavankalyan5008]

Hehehe

[@techbarikcom]

Great to see free course from MIT!

[@davidledger5941]

If the peak that particular peak dataset is always a pyramid shape then its constant time. Check 2 points on either end of the array and then find the intercept of the two resultant lines, that is x intercept of the two lines is the index that the peak is in the array. The limits of this approach are the precision of the numerical calculations.

[@SurfHarri]

I wish my University lecturers were so well spoken and were more interested in getting me interested in conveying excitement about the topic instead of just getting through the lecture...

[@user-uj8to2zd4t]

I think the professor have not explained the implication of the 1D and also 2D algorithm. The key is that for any 1D or 2D array there is a largest element(>= any other) and thus must have a peak. (Theory 1) However, in an array the sub-array's peak may not always its parent's peak if the largest element is on the edge and has a bigger element next to it. (Case 1) To find a peak in a sub and at the same time avoid Case 1, we must choose a larger side to ensure that even if the largest value is on edge, it is still larger than its boundary in the parent array. This is also why in 2D search we want a global maximum. We want to ensure that even if the max is at the boundary, it is still larger than the any element in the boundary column containing the global max we found. And thus the global max in the larger side must contain a peak.

[@lahaale5840]

This is a wonderful course the only minor problem is some of the recitation videos and notes are missing. Thanks, MIT!!

[@sober_junkie5709]

I feel super grateful to the free content that MIT has put up

[@demolazer]

Same here. It's incredible. I've been watching lectures, revising the lecture slides, making notes, etc. All for free.

[@EderNelQuezadaRamos]

Thank you MIT. Great lecture

[@rahulbhardwaj3668]

Hey! It's been 5 years since no one had like your comment I'm the first to like 😂😂

[@SarkhanRasullu]

This medium article explains the same of the video. Who wants to read can use: medium.com/@rabin_gaire/algorithmic-thinking-peak-finding-ad6f7415d154

[@pahvalrehljkov]

this guy seems like a really experienced teacher...

[@sandeshpatil7664]

MIT teaching faculty is extraordinary .

[@touhidulislam9871]

this is my great fortune to have a class of MIT, its amazing to particpate in it☺☺

[@rudhisundar]

This channel is a gold mine!

[@debjyotichattopadhyay6679]

thanks a lot MIT ..you are just awesome

[@canberkpower]

When finding the middle column, the equation should be j=(m+1)/2. If j is a floating-point number, then it needs to be rounded up or down.

[@tommm7377]

I'm not understanding the complexity of the 2D peak algorithm (@<a href="#" class="seekto" data-time="3161">52:41</a>). Shouldn't I have: log2(m)+1 terms "O(n)" ? For example with m=2: T(n,2) = T (n,1) + O(n) = O(n) + O(n). Here I have 2 O(n) that is log2(2)+1. Thanks in advance if you can help me to figure this out.

[@TheQuancy]

I needed this. My current algorithms class is a joke. For the 1st 6 weeks professor, on average, cancelled class once a week (we have classes 2x a week). Half of the 1 class we meet up, is him telling stories/making jokes. Then the whole corona virus thing hit, and we are now doing lectures online, where the first week he cancelled a class again. His current online lectures all choppy because I think he is using a laptop webcam to record him writing on a whiteboard. The quality of the videos are 240p at best, and can drop even worse at times. Looking at the syllabus, we are 4 weeks behind schedule.

[@imjko432]

hey isn't this a little outdated? do you still find it relevant to study from this series? It was created in 2011.

[@huntersparky7446]

Prof. Srini Devdas is Indian.. Proud💪💪

[@yubin_jo]

i enjoyed this lecture thoroughly, thank you!

[@10uRization]

<a href="#" class="seekto" data-time="25">0:25</a> thats my dream sentence to say in the future

[@rronsherifi4210]

This lecture made me reconsider going to Computer Science. Hard af

[@MohitK96]

I am excited to start 🤗

[@bezelyesevenordek]

i liked the whole playlist because every video has subtitles that didnt created by Google but someone listened to the lectures himself. so i can follow the lecture more efficently with the subtitles thanks for that. love the lesson, hate the math part of it.

[@error.418]

That's where I did my Fulbright

[@FknifePK]

Well, knowledge of basic algorithms and data structures is definitely a must for every programmer, but its just a small part of "a bigger picture". You should also be familiar with Web technologies, programming languages, frameworks etc. Also remember that "technology aspect" wont make your website successful if you do not have a GOOD IDEA (which targets people's needs), marketing and promotional side etc. Good luck :)

[@kumarnatwar152]

Your teaching style is so excellent

[@ashishdash4554]

every student needs this kinda cool prof.

[@pdeezz]

In the 2nd attempt of the 2D version, this algorithm works to find *a* peak, not the maximum element in the matrix, correct?

[@study7691]

Great lecture! Just wished the cameraman wasn't in love with back of professors head!!!

[@yojodingy6334]

I hope you’re able to find sincerity in your life

[@rodolfoazevedo4082]

Thanks MIT for this precious lesson!

[@world_tarvel]

Excellent Lecture. Thanks MIT

[@maresfillies6041]

Damn, I wish I went to MIT, this guy could teach! :) Bro....

[@LittleBlacksheep1995]

IDK why but I'm fascinated over the thought of fighting my way into MIT. The chances are not high at all, but I wil give it my best shot.

[@BreakTheBeat852]

Minh Phúc Nguyễn You can do it man, if you haven’t already

[@toxicvoid0663]

@@LittleBlacksheep1995 did you get it?

[@freeeagle6074]

All the other professors like linear algebra and discrete math et al are fabulous professors. They make math and CSA not hard and interesting.

[@willz17-DRX]

@@LittleBlacksheep1995 any update?

[@adityamehra3661]

I got this question in a tech interview! Provided O(n) solution. Here for the log(n) solution.

[@FullOfBool]

I really love the seat cushion idea.

[@sugengsukoyo4901]

My master said : " GREAT TEACHER WILL ALWAYS MAKE GREAT STUDENT " So , i'm not great student , and i blame to my teacher for this .. but this is outstanding knowledge for free , wow .... Peace from Surabaya , Indonesian ..

[@kavindugithmin282]

When I read the comments I saw there were some people with a confusion about peak finding.I think It's better to know that he was not finding the "Highest Peak". He was just finding "A Peak". correct me if I am wrong.

[@mhdsbk]

i think so