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
7 жыл бұрын
sellout
@SpaghettiToaster
6 жыл бұрын
MIT gets billions of government funding. Billions.
@QQTrick1QQ
6 жыл бұрын
I paid for my MIT education in cash!
@vertigo6982
5 жыл бұрын
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
5 жыл бұрын
ATXpert sellout because hes sharing knowledge?
@vertigo6982
5 жыл бұрын
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
5 жыл бұрын
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
5 жыл бұрын
@@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
5 жыл бұрын
Goodwill hunting A library card goes a long way
@slackerengi2401
5 жыл бұрын
@@blasttrash EE student here, bought components, soldering iron, and multimeter on Amazon Saw free lectures on KZitem 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
5 жыл бұрын
@@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. :)
@emo_nemo
8 жыл бұрын
The lecture starts at 0:22. Course overview : 2:51 Course content : 8:37 First problem (Peak finder) : 15:31 "Straight forward" algorithm : 18:53 "Divide & Conquer" (a recursive) algorithm : 27:42 Second problem (2D Peak finder) : 36:16 Greedy Ascent algorithm : 37:30 "Divide & Conquer 2D" algorithm (defunct) : 42:40 "A working 2D recursive" algorithm : 47:35
@akshaybhatt8332
8 жыл бұрын
bro could plz suggest me the best data structure video channel...i'm a begineer
@grahamcraqqa
7 жыл бұрын
You're awesome
@Lens_lores
7 жыл бұрын
doing god's work
@BULLSHXTYT
7 жыл бұрын
Wow I love you bro.
@player1coding958
7 жыл бұрын
Where's my fucking son?
@elizabethphillips1496
4 жыл бұрын
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
3 жыл бұрын
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
3 жыл бұрын
@@PHlophe ngl it's still taught like that
@deanmason7160
3 жыл бұрын
@@mastershooter64 this is a straightforward Algorithm
@jeffschlarb4965
3 жыл бұрын
endless supply ...Stanford, Berkeley, CMU, Cal Tech and Harvard ...machine learning, AI....
@notagain3732
2 жыл бұрын
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
@samyakjain7300
3 жыл бұрын
"Inefficient but correct is definitely better than being efficient but incorrect" - Srini Devdas
@marcospark2803
2 жыл бұрын
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
@mauricemaeterlinck8799
4 жыл бұрын
It feels like this Professor is very passionate and knowledgeable about the course material! The hour flew by
@obicaban1269
3 жыл бұрын
set playback at higher than 1x... flies by even faster ;P
@jeffschlarb4965
3 жыл бұрын
Try Harvard CS 50
@harv609
3 жыл бұрын
@@jeffschlarb4965 that's a foundational course, this one's lil more advanced than that
@jeffschlarb4965
3 жыл бұрын
@@harv609 I was speaking in regards to a passionate teaching style...
@harv609
3 жыл бұрын
@@jeffschlarb4965 oh I see, yeah. I agree
@KrutikaPatil0109
3 жыл бұрын
Really grateful to MIT and Srini for making this course accessible through OCW... Really enjoyed this course
@akainu3668
3 жыл бұрын
Alongside this course what did you follow to master ds, algo?
@KrutikaPatil0109
3 жыл бұрын
CLRS
@bat_man1138
3 жыл бұрын
Was it worth??i mean whole course
@juanmoscoso0
3 жыл бұрын
@@KrutikaPatil0109 you read all of it?
@ramansarabha871
3 жыл бұрын
@@juanmoscoso0 I doubt that. She did Andrew Ng's deeplearning specialization, was familiar was supervised, unsupervised and semi-supervised learning from work.
@thepianist7379
6 ай бұрын
No bullshit, no cheap jokes. Just pure joy of knowledge. How college courses should be taught!
@shubhamrauniyar101
4 жыл бұрын
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.
@giwrgosnikolaidis1096
2 жыл бұрын
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
@4cricket24
4 жыл бұрын
Great initiative by MIT. I never imagined i will be able to sit and learn from an MIT professor for free!! 👍 എല്ലാ മലയാളികൾക്കും എന്റെ ഹായ്
@amalfrancis4846
4 жыл бұрын
from kannur......
@joeljose182
4 жыл бұрын
@@amalfrancis4846 njanum kannur
@joeljose182
4 жыл бұрын
@@amalfrancis4846 evideya
@RamMohammadJosephKaur
4 жыл бұрын
Kottayam
@svs4305
4 жыл бұрын
puthenvelikara
@fgfanta
5 жыл бұрын
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.
@TrendingPoonai
4 жыл бұрын
Learning a course after a lecture feels like I'm into college, Thank you so much MIT for all your open source curriculum 😊🙏🙏🙏
@premgarg5534
3 жыл бұрын
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
10 ай бұрын
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
9 ай бұрын
@@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 :)
@NORTE_559
3 жыл бұрын
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
3 жыл бұрын
Spend some time on a Basic Data Structure course. It will make sense then.
@yojodingy6334
3 жыл бұрын
Awesome! Please go try to get attention somewhere else then please!
@Thisisnotmyrealname8
3 жыл бұрын
@@yojodingy6334 Can you please explain what an algorithm is?
@yojodingy6334
3 жыл бұрын
@@Thisisnotmyrealname8 no thanks, watch the video
@abhishekpanthi6496
3 жыл бұрын
@@yojodingy6334 hey!! stop acting Smart and try to get a life please!!
@kritgrover
2 жыл бұрын
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
2 жыл бұрын
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
2 жыл бұрын
I'll do those 2 first you did, they seem pretty good. Thanks for commenting man !
@kritgrover
2 жыл бұрын
@@aishwaryadharmadhikari7165 yup they are very helpful and infact they are the prerequisites for this course.
@dejidevi3990
2 жыл бұрын
@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
2 жыл бұрын
@Aishwariya dharmadhikari plzzz provide all the link
@arindam1249
2 жыл бұрын
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.
@janmichaelaustria620
3 жыл бұрын
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 @24:52, 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 @24:52, was already doing what I'm doing now well before he even took the class. Start while you're really young!
@utkarsh_108
3 жыл бұрын
do you think in long term software engineer role is good considering the dynamic nature of job scenario
@Wereld03
2 жыл бұрын
@@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
2 жыл бұрын
The array there is not necessary sorted, so binary search doesn’t seem like a valid approach. Did I miss something?
@Everspy
2 жыл бұрын
@@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.
@wontpower
5 жыл бұрын
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
2 жыл бұрын
My uni professors make simple concepts more difficult, what's worse is that they do it with confidence.
@bikeshregmi946
3 жыл бұрын
I really feel like I am at MIT and having a live Lecture. Thank You, MIT
@JohnnyDoeDoeDoe
10 жыл бұрын
I felt smarter after watching just the course overview, excited to watch the entire series!
@aashish77
4 жыл бұрын
Hey
@hosea_br
3 жыл бұрын
@Deonex replying to a 7 y/o comment xdd
@danid1464
3 жыл бұрын
Hello, how are you after 7 years?
@JohnnyDoeDoeDoe
3 жыл бұрын
@@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
3 жыл бұрын
@@JohnnyDoeDoeDoe man, this gives me hope for the future. I'm wondering, did you go to a university?
@AshutoshShelkeP
2 жыл бұрын
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
2 жыл бұрын
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
Keep it up MIT ....it's such a nice job to give lectures from excellent professors in online for completely free.....THANKS
@RushabhShahclwarrior
2 жыл бұрын
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!!
@pranki2254
3 жыл бұрын
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??
@PeterReginald
8 жыл бұрын
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
8 жыл бұрын
Wait so I won't learn anything if I only know C?
@PeterReginald
8 жыл бұрын
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
8 жыл бұрын
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
7 жыл бұрын
Peter Reginald thanks
@derollo3
7 жыл бұрын
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.
@aidenrichard2898
3 жыл бұрын
What if the cameraman started learning from this lecture and finds himself becoming a programmer :)
@rintrah81
3 жыл бұрын
He’s already programmed a robot to do the camera work.
@mirtuzzamitthi4755
3 жыл бұрын
MIT president is the cameraman.
@rachakondaeshwar4129
3 жыл бұрын
Yep
@patrickalegria7620
3 жыл бұрын
Or the janitor.
@dwightpeters
3 жыл бұрын
Nothing wrong with being a cameraman. If you imagine a world with only programmers, it would be awful
@naraendrareddy273
3 жыл бұрын
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.
@syd6358
Жыл бұрын
15:30 specific problem -peak finder 28:10 divide conquer algorithm 34:30 how usefulness depends on size of input data 36:15 peak for 2d
@user-uj8to2zd4t
7 жыл бұрын
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.
@svellene
10 жыл бұрын
I like how the chalk is soft ^_^
@vantalk2021
7 жыл бұрын
svellene Lol Lol ASMR*
@jordanmoorman5024
6 жыл бұрын
Jill Talk literally listening to this for asmr but multitasking to get some of that brain power going too.
@dharmadhikariatharva
6 жыл бұрын
MIT
@Cognitoman
6 жыл бұрын
bitch I didnt ask
@nands4410
6 жыл бұрын
MIT
@kingnand90
4 жыл бұрын
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
@jonsnow9246
4 жыл бұрын
All these students are the ones who say they did not study for exam and still top the class.
@SoumilSahu
4 жыл бұрын
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
4 жыл бұрын
Doubt it, MIT courses are hard as hell
@alphaco3868
4 жыл бұрын
@@joeyGalileoHotto MIT courses are quite easy....But our UN****** education system quite hard(Deep fact).
@mohammedjassim9250
4 жыл бұрын
@@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
4 жыл бұрын
@@mohammedjassim9250 Yes you can...I recently watched this lecture __kzitem.info/news/bejne/q4av23xqqop9jWU 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)
@actualprogramming
4 жыл бұрын
best time to be alive, you can study from best teacher across the world for free at home.
@encrypt3dbr0k3r
3 жыл бұрын
Thank you MIT for uploading this content. Its truly a blessing and you are doing a good service to our planet Earth.
@DentrifixoRam88
6 жыл бұрын
Watching this video from Argentina and I think it's amazing and great you guys share this w/ the community. Thanks!!
@mmkvhornet7522
Жыл бұрын
Wow what a course !! the professor makes it so easy to understand algorithms thank you MIT !
@rkirmizi
8 жыл бұрын
This channel is a gold mine. I'm so happy about finding this :D Thank you very much.
@sharadrajput379
4 жыл бұрын
This channel is a goldmine. Great information
@WhiskeredBope
3 жыл бұрын
I LOVE how the teacher handles the syllabus!
@sober_junkie5709
3 жыл бұрын
I feel super grateful to the free content that MIT has put up
@demolazer
3 жыл бұрын
Same here. It's incredible. I've been watching lectures, revising the lecture slides, making notes, etc. All for free.
@matthewgale1176
2 жыл бұрын
What a comforting teacher... Very clear and straight remarks The questions of life are very import We will find how defaults defaults are l8fe
@TheQuancy
4 жыл бұрын
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
3 жыл бұрын
hey isn't this a little outdated? do you still find it relevant to study from this series? It was created in 2011.
@JeremyVisser
11 жыл бұрын
Excellent camera work. Wish this camera guy could film all lectures -- he handles the lecturer's walking really well.
@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
@anupamdubey5736
2 жыл бұрын
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.
@SurfHarri
5 жыл бұрын
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...
@AlucardHV
4 жыл бұрын
I always dreamed on going to MIT... and now I can do it from home. Thank you :)
@keshavjha9835
4 жыл бұрын
once you get it, that moment will make your day.
@ramsmallkay
4 ай бұрын
FYI.... For One Dimensional Array the Binary Search algorithm works only on a Sorted Array.
@AnujGupta-ee8dx
6 жыл бұрын
Took some time to realize why he found the global max. Try for A = [ [12, 15, 16, 27], [10, 8, 3, 28], [9, 7, 25, 26], [8, 6, 2, 3] ]. In first iteration j will be 2nd column of A, in next iteration j will be 3rd column of A, and in final iteration j will be 4th column of A. Answer = 28. Realize, as we move from 2 --> 3 column, the condition checked was 15(max of 2nd)
@TheNitroPython
3 жыл бұрын
So much knowledge in just an introduction course, love it.
@kavindugithmin282
3 жыл бұрын
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
3 жыл бұрын
i think so
@meikandanathann921
4 жыл бұрын
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)
@markconley5730
27 күн бұрын
this lecturer is excellent and having had at least 20 different uni lecturers over the decades i should know; there are some shocking ones which oddly are the nicest characters ...
@davidledger5941
4 жыл бұрын
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.
@jurgenblick5491
5 жыл бұрын
I am so glad that I found this. Been interested Algorithms for a long while.
@hansolo7988
8 жыл бұрын
Wow, there's 47 of these. I love the internet :3
@unhappywig
4 жыл бұрын
i swear youtube recommended me this. i was only looking for how to spell mathematics.
@shunxiancai5878
Ай бұрын
thanks for uploading the recitations, I watched this series long time ago and now I get to review it with recitations!
@pahvalrehljkov
4 жыл бұрын
this guy seems like a really experienced teacher...
@ryanchiang9587
5 жыл бұрын
computer science undergrad major core courses: calculus, linear algebra, discrete mathematics, data structure, assembly language, operating systems, and algorithm,...etc.
@rudhisundar
5 жыл бұрын
This channel is a gold mine!
@rohitjain2910
9 жыл бұрын
Finally I figured out why he searches for a global maximum in the column instead of a local peak. It is because the peak will be guaranteed in case of a row with a number which is already a max number in a column. In all other cases, it will not be guaranteed. I think he left this part so that the students may think about it. In the lecture notes, he has asked this question: "What if we replaced global maximum with 1D-peak in Attempt #2? Would that work?" The answer is that it won`t, because the peak won`t be guaranteed. The explanation of this is that a largest element in a 1D array is definitely a peak.
@rohan_elysium
9 жыл бұрын
+Rohit Jain Where Can I Find The Lecture Notes?
@rohitjain2910
9 жыл бұрын
+Rohan Menon You can find Lecture Notes, Transcripts etc. at this link goo.gl/vkxGVS
@raz0rstr
8 жыл бұрын
+Rohit Jain Can you pelase explain step-by-step what's happening? So 1. We pick a middle column and find the global max( this guarentees that there is a peak in that specific column?) 2. Then what? You comepare the values to the right/left of that specific peak?
@rohitjain2910
8 жыл бұрын
+Toiletwifi 1. We pick the middle column and find the global max in that column. Lets call it x 2. We compare x to its left cell and right cell. 3. If both left and right are smaller than or equal to x, then x is the peak, otherwise we proceed to step 4 4. if left cell > =x, then we now perform the same operation on the grid on left portion of column containing x otherwise the right portion. 5. We peform this operation recursively, at some point, either we will find a peak in the process on a x or we will be left with only one column. 6. If we are left with only a single column, then the global max of that column will be a peak. Essentially what we are doing is: 1. We are ensuring that we are always narrowing our scanning area by half in each iteration, always moving towards the side containing a number greater than the max of middle column. 2. This ensures that either we get a peak in the process or we are left with a single column which has atleast one value that is >=its adjacent values (because it is greater than the global max of the adjacent columns.) 3. Now before we were left with a single column in the end, we now know that this column has a value (say y) larger than the global max of the adjacent columns . So even if there is a value greater than y in our single column, it would surely be greater than its adjacent values and is therefore a peak. This last point is most crucial to understand, and can be understood more clearly with help of self designed examples and following this algo.
@raz0rstr
8 жыл бұрын
Rohit Jain Thanks for the explanation bro! Sorry I just started coding/algos, things come slow to me. I understand everything up to step 3. So I'm still a bit confused. For step 4. let's assume x =10 and left cell=20 (assuming left cell > =x), we are now in that coloumn containing 20. Now what's the next step. We check that WHOLE coloumn ( the one with the 20) and find a global max. And then look to left and right cell. THen repeat until we find a peak? So we have to find a global max in every coloumn ( assuming step 3 doesn't work out). Please explain in baby words/example, how this will guarentee a peak. Sorry once again for my dumb understanding question
@johnmacn
2 жыл бұрын
I wish the colleges and universities here had teachers like this man. They all have thick accents and do not explain in detail like this instructor. No wonder MIT has the rep it has. wow.
@krislam2603
3 жыл бұрын
Watching this in quarantine... so much better than Waterloo’s voice-over slides approach for giving lectures during corona. Kinda salty that I’m paying Waterloo just to get better content for free online
@dhruv4731
3 жыл бұрын
Lol
@SacWebDeveloper
4 жыл бұрын
One good thing about watching this at home is you don't have to answer the instructor's questions for couch cushions. =)
@jegie
4 жыл бұрын
Agree
@FknifePK
11 жыл бұрын
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 :)
@tommm7377
3 жыл бұрын
I'm not understanding the complexity of the 2D peak algorithm (@52:41). 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.
@ouaremoualid4883
5 жыл бұрын
It is very awesome that we can follow a great courses from great institutions like MIT for free .
@techiesubba1225
6 жыл бұрын
Long live MIT, providing this content for free. It's pure gold for someone like me from a third world country.
@geetaagarwal4622
4 жыл бұрын
Which country
@SarkhanRasullu
5 жыл бұрын
This medium article explains the same of the video. Who wants to read can use: medium.com/@rabin_gaire/algorithmic-thinking-peak-finding-ad6f7415d154
@mlynskey2
5 жыл бұрын
Great lecture. I'm looking forward to the rest of the series!
@rockypalmer6779
3 жыл бұрын
"Peak finding" is just a fancy name for finding the max value of an ANALOG continuous function. It won't work for a DIGITAL or discrete function. Only useful for processing some things.
@theJasin
3 жыл бұрын
Its literally the same concept for a DT function? Look into Signals / Signals and Systems it will teach you more about these subjects.
@cwl994
8 ай бұрын
The psets for the 2011 version look so much more interesting than the 2020 version. So I'm doing this course first, converting the Python2 files to Python3 as I go.
@lggood8375
2 жыл бұрын
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.
@wireboard6175
3 жыл бұрын
Thank you MIT for sharing videos! They are incredibly useful.
@lanci2154
3 жыл бұрын
34:34 Why are we gonna do O(1) log2n times and not n times? Where does log2n come from? I'm sorry if this is a silly question, I just don't get it no matter how much I think about it.
@rronsherifi4210
4 жыл бұрын
This lecture made me reconsider going to Computer Science. Hard af
@luctrollsaur5644
3 жыл бұрын
I love these videos because it shows you that your local land grant university has the same quality of education. It's the choices you make as an individual that define your career :)
@das6109
10 ай бұрын
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.
@butifarra61
10 жыл бұрын
it is free and I thank you...
@HuseyinKaanKoyukan
7 жыл бұрын
Unfortunately not.. You have to pay the online tuition fee to this bank account 32423545464566
@balipavankalyan5008
6 жыл бұрын
Hehehe
@indrajeetjoglekar1657
10 жыл бұрын
How in the world does the binary search like algorithm help with the 1 dimensional peak finder algorithm? The array may not be sorted..Confused.
@ksceriath8346
10 жыл бұрын
It might seem counter-intuitive.. but it works.. Using approach similar to binary-search, only gives an indication of which direction to proceed in... You, eventually, might not end up at the peak your previous binary-search comparison was indicating to... Its like saying that, 'if at i, the array is sloping up towards left, then there must 'definitely' a peak somewhere towards the left.. whereas its 'possible' that I might not find one if I go towards right.. So, now lets look at [left/2] ...' ...and so on.
@warrenyazzie9975
10 жыл бұрын
As 25:30 the professor states that he is not looking for THE peak, he only wants to find A peak. It does not matter which peak he finds, just find one. It should be understood that the algorithm he is discussing is not intended to search through a sorted list. It's intended to search through an unsorted list of "real-world" values. The lists this algorithm is for will have one or more peaks of which he is only concerned with finding one arbitrary peak.
@rockwithyou2006
10 жыл бұрын
If the array was sorted, the complexity for finding a peak would be O(1). The last element :D
@TabmansTube
10 жыл бұрын
binary search itself is not being used but the technique of splitting array into halves on every next step is being used (which is the same technique that binary search uses) + the problem is to find 'any' arbitrary peak
@warrenyazzie9975
10 жыл бұрын
Murali Mohan You either did not watch the video or did not understand what was explained in the video. That IS what the professor is telling the students to do. The algorithm he is describing is NOT looking for the highest number in the set. He is only looking for a peak relative to a random starting position. As the professor states early in the video, this class is an introductory course in programming and algorithm design. It is not intended for students who already have experience with programming. It is intended for students who have no experience. The example he provided is intended to give students new to programming a fundamental idea of how an algorithm works.
@maresfillies6041
10 жыл бұрын
Damn, I wish I went to MIT, this guy could teach! :) Bro....
@LittleBlacksheep1995
5 жыл бұрын
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
5 жыл бұрын
Minh Phúc Nguyễn You can do it man, if you haven’t already
@toxicvoid0663
4 жыл бұрын
@@LittleBlacksheep1995 did you get it?
@freeeagle6074
4 жыл бұрын
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
3 жыл бұрын
@@LittleBlacksheep1995 any update?
@sandeshpatil7664
3 жыл бұрын
MIT teaching faculty is extraordinary .
@meh398
4 жыл бұрын
To anyone struggling to understand why he chose to find global max instead of local 1D peek of a column: Because there maybe more than 1 peek in a 2D array. Maybe that global max of a col is not a peek we are finding, but the left/right haft of it surely has one. Maybe another local 1D peek is a 2D peek, but here I think the algorithm is just trying to find the easiest one. Traversing a whole 1D array to concern every peek is way more expensive since we just have to look for ONE peek in a 2D array only.
@touhidulislam9871
5 жыл бұрын
this is my great fortune to have a class of MIT, its amazing to particpate in it☺☺
@BohdanDuCiel
4 жыл бұрын
Small note: array should contain sorted elements for this binary search to be implemented
@automonk1676
4 жыл бұрын
If its sorted than the peak will always be the last element. The element to the right will always be greater until the last element
@BohdanDuCiel
4 жыл бұрын
Auto Monk You are right in case the peak restricted to [min,max] but binary search is used to find any x element inside the array. So in a particular case where x doesn’t belong to [min,max] then x indices might be different from 0 or Lenght+1
@garrysohi4540
6 жыл бұрын
The prerequisites for this course are: 6.01 Introduction to EECS I and 6.042J Mathematics for Computer Science. However I checked MIT's site and the 6.01 Introduction to EECS I shows two different courses: 6.00.1x Introduction to Computer Science and Programming Using Python and 6.00.2x Introduction to Computational Thinking and Data Science as MITx versions which are also available separately on KZitem. So which ones am I supposed to do? Please give me links for KZitem playlists
@JaimeEcheverryG
Жыл бұрын
The links to the other courses: 6.0001 Introduction to Computer Science and Programming in Python. Fall 2016 kzitem.info/door/PLUl4u3cNGP63WbdFxL8giv4yhgdMGaZNA MIT 6.042J Mathematics for Computer Science, Fall 2010 kzitem.info/door/PLB7540DEDD482705B MIT 6.0002 Introduction to Computational Thinking and Data Science, Fall 2016 kzitem.info/door/PLUl4u3cNGP619EG1wp0kT-7rDE_Az5TNd MIT 6.006 Introduction to Algorithms, Spring 2020 kzitem.info/door/PLUl4u3cNGP63EdVPNLG3ToM6LaEUuStEY
@DonnaMiller-h9c
Жыл бұрын
Классный канал, от подачи не устаёшь
@riverland0072
6 жыл бұрын
You may feel divide and conquer will not work because the array is not sorted. but you only need to look at the question, the definition of a peak and an example to convince yourself that it actually works
@study7691
4 жыл бұрын
Great lecture! Just wished the cameraman wasn't in love with back of professors head!!!
@yojodingy6334
3 жыл бұрын
I hope you’re able to find sincerity in your life
@tylerdurden4169
4 жыл бұрын
Look at the professor he is very much active through out the lecture >3
@PHlophe
3 жыл бұрын
keeps the weight down to be dynamic.
@apanapane
9 жыл бұрын
Great lecturer. Thank you, professor.
@lifeviz28568
2 жыл бұрын
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.
@sugengsukoyo4901
2 жыл бұрын
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 ..
@Zatocrew
3 жыл бұрын
26:00 why can't my professors be this cool
@jaisinha1378
3 жыл бұрын
Bcz they do not get $35,000+ per month
@rickyponting6526
9 жыл бұрын
Can someone tell me what is the difference between 6.046J course and 6.006 course
@mitocw
9 жыл бұрын
+Ricky Ponting 6.006 is more of an introductory course on algorithms and is considered a prerequisite for the more advanced 6.046J.
@shubhamk530i
8 жыл бұрын
+Ricky Ponting Are you the former Australian cricket team captain?
@mujaheedisahabdullahi4206
8 жыл бұрын
Hi I apriciate your algorithms turtorial
@adityamehra3661
4 жыл бұрын
I got this question in a tech interview! Provided O(n) solution. Here for the log(n) solution.
@hritwiksom3032
4 жыл бұрын
Someone clarify this for me: In the 2d peak finding algo, the complexity is O(NlogN)? After choosing j, we find the global max, which takes O(N) time, traversing the whole col. After that we choose the left or right half depending on which is greater on the same row than the global max of current col. In best case, the global max is greater than both of them, here we exit the loop as peak is found. The second step takes O(logN) time as we are eliminating the search space by 1/2.
@oby-
3 жыл бұрын
Complexity is O(nlogm), where n = height of rectangle, m = width. Values of N and M could be wildly different, even consider where N < logM for some inputs N and M, so it’s important to differentiate. As for the recurrence relation, finding the global max in column j takes O(n) time. There isn’t any operation that takes logM times, it is the O(n) operation of finding the global max that is repeated logM times. The O(n) operations are executed in the exact same way a binary search is. Hope that helps
@saketgupta4758
4 жыл бұрын
When you go through confusion and feeling that, it can't be log n and prof is wrong, then, watch again, edge cases 17:37 of video. It will clarify the problem statement.
Пікірлер: 2,1 М.