MIT 6.006 Introduction to Algorithms, Fall 2011 View the complete course: ocw.mit.edu/6-006F11 Instructor: Erik Demaine License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
Пікірлер: 300
@lifeoftomi_4 жыл бұрын
You know what I like about the MIT lectures? They tell you the application/use case of what you're being taught. That makes a huge difference for beginners who have no way of visualizing these abstract concepts. Many people who get discouraged with stuff like this aren't able to relate with the content and feel like it's something crazy out there. It's the simple things.
@manavarora76444 жыл бұрын
I could not agree more with this. The biggest difference that I spotted along the lecture
@dominic81473 жыл бұрын
That's not the case for junior or senior level MIT OCW courses. The same professor teaches an advanced data structures course on KZbin and those are so academic and abtruse that he doesn't write code and only sometimes gives applications. Like his succinct binary trees data structure video. He gives one use (the Oxford English dictionary), but besides that he just explains its math.
@user-eg2jr8dt1j3 жыл бұрын
The secret is that some of the professors actually don't KNOW why they are teaching what they are teaching. Professors aren't always allowed to just "profess" what they know these days. This is the grand illusion of academia, many who know what's going on, don't teach. Many who teach would simply prefer to waste their time in a laboratory doing research work.
@shohanur_rifat2 жыл бұрын
Right you are my friend.
@missriri-if9yl5 ай бұрын
u so real
@thepeopleofblore7 жыл бұрын
20:57: Representation of graphs 31:10: BFS
@cheemtu23757 жыл бұрын
thanks man
@balkan9177 жыл бұрын
why would you wanna skip? this guys chit chat is excellent, I can listen to it all day :)
@eric39707 жыл бұрын
it helps me save up some time thx
@devinjackson64376 жыл бұрын
thanks so much
@sunelkora95036 жыл бұрын
BF
@sergeykholkhunov18883 жыл бұрын
00:40 graph search 02:00 recall graph 05:20 applications of graph search 10:30 pocket cube 2x2x2 example 20:25 graph representations 20:40 adjacency lists 26:00 implicit representation of graph 29:05 space complexity for adj list 31:05 breadth-first search 34:05 BFS pseudo-code 36:58 BFS example 43:27 shortest path 48:35 running time of BFS
@solwex Жыл бұрын
Hey there! There are some other videos in this course playlist that explain the terms used in this one. - represent graph in Python: kzbin.info/www/bejne/a3vbhJt6j8SsotE - adjacency list in Python: kzbin.info/www/bejne/eWa2gaaPbJeSea8 - examples of theta, O, omega: kzbin.info/www/bejne/hmjJo5Z4lJKaatk - what is hashing: kzbin.info/www/bejne/Zn7CnHynndyVfNE - python implementation of iterator: kzbin.info/www/bejne/Y3XaeKWAba-resU
@tanweermahdihasan41193 жыл бұрын
Can we just take a moment to appreciate how brilliantly the camera work accompanied this already perfect lecture!
@chanpol3217 жыл бұрын
Breadth-first search (BFS) is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key'[1]) and explores the neighbor nodes first, before moving to the next level neighbors. BFS was invented in the late 1950s by E. F. Moore, who used it to find the shortest path out of a maze,[2] and discovered independently by C. Y. Lee as a wire routing algorithm (published 1961).[3][4]
@jessielucky55305 жыл бұрын
Super genus guy! From Wikipedia Demaine was born in Halifax, Nova Scotia, to artist sculptor Martin L. Demaine and Judy Anderson. From the age of 7, he was identified as a child prodigy and spent time traveling across North America with his father.[1] He was home-schooled during that time span until entering university at the age of 12.[2][3] Demaine completed his bachelor's degree at 14 years old at Dalhousie University in Canada, and completed his PhD at the University of Waterloo by the time he was 20 years old.[4][5]
@tianna308 Жыл бұрын
omg can't believe I graduated from the same university as him.
@rikampalkar2 жыл бұрын
One of THE best explanation of BFS, I’ve came across. It’s something about the way he explains. Brilliant.
@farhan7874 жыл бұрын
"There are more configurations in a 7*7*7 cube than the number of particles in the known universe" 27:35 - Erik Demaine (2011)
@wetbadger21743 жыл бұрын
So how does anyone solve it?
@sukhmandersingh43063 жыл бұрын
@@wetbadger2174 by not trying all possible combinations/permutations but trying only the ones that make sense.
@seansmith16857 жыл бұрын
I think Erik's lectures are very good
@RobinLinus9 жыл бұрын
Totally appreciate you mentioning the diameter O(n^2/log n) of n x n x n rubic's cube!!!
@7th_CAV_Trooper2 жыл бұрын
When I was a kid I used a screw driver to pry the Rubics cube apart and put it back together solved. That's when my parents knew I would be an engineer and not a mathematician.
@IamFilter948 жыл бұрын
Scissors cuts Paper Paper covers Rock Rock crushes Lizard Lizard poisons Spock Spock smashes Scissors Scissors decapitates Lizard Lizard eats Paper Paper disproves Spock Spock vaporizes Rock (and as it always has) Rock crushes Scissors
@bobbob36306 жыл бұрын
no
@intellagent76226 жыл бұрын
LMFAO
@nandkishorenangre82445 жыл бұрын
BBT ha
@wip7275 жыл бұрын
I am sorry, can you repeat that?
@shalindeval87463 жыл бұрын
His T-Shirt lol
@NewtonCazzaro7 жыл бұрын
This is amazing, I am a student of Algorithms at the University of Nevada, Las Vegas. I really appreciate this class, thank you so much for the KZbin videos MIT!!!!
@awful9992 ай бұрын
damn that’s crazy i’m studying cs there right now, im taking algorithms at the moment
@sahilvelhal14354 жыл бұрын
MIT teachers make student love the subject they teach :)
@vivekmittal2294 жыл бұрын
I really like the sound of the chalk.
@jirokaze63804 жыл бұрын
His friendly tone makes the revising process so much easier!
@sam.kendrick6 жыл бұрын
Thank you! Love Erik's lectures!
@shreyakjain96924 жыл бұрын
Thank you MIT for providing these lectures. These are very helpful.
@48_subhambanerjee226 күн бұрын
Ayo.... ☠️ MIT FOR A REASON... Such in depth lecture 😁
@99DaNtEmAN239 жыл бұрын
This guy's lectures really puts the Computer Science lectures at UofT to shame. But then again he is a prodigy, still doesn't justify why we get grad-students as "profs" though. Just my 2 cents
@lolpe10006 жыл бұрын
Well in the UoC, our prof doesn't even go into much depth... The guy in this video is amazing.
@bharasiva966 жыл бұрын
They go "Breadth-First" I suppose.
@raymondlion3145 жыл бұрын
At UIUC, we were taught such stuff in C++ :(
@janmadle42437 жыл бұрын
This lecture was really "Breadth"-takíng :-D ty Erik
@danielday31627 жыл бұрын
oh my.
@janmadle42437 жыл бұрын
oh you
@umashnkaryadav47196 жыл бұрын
SD ex cc
@aravindvarier18655 жыл бұрын
You are breadth-taking.
@zoltannemeth88644 жыл бұрын
Personally, I prefer a less “edgy” pun, with greater “depth”. (Haha!, graph humor!)
@siddhantjain95967 жыл бұрын
My god! His t-shirt also has a graph!! Brilliant!
@amanarora4766 жыл бұрын
Yup, and that too a complete graph.
@satyakighosh42265 жыл бұрын
bros before hoes
@2864325312 жыл бұрын
Much better than the newer version. Glad I come back and watch this.
@ordinarycoder80908 жыл бұрын
Best lecture on BFS.. Erik Demaine rockss....
@sarpersar80108 жыл бұрын
Thanks to Erik Demaine
@seansmith16857 жыл бұрын
"There are more configurations in this cube than there are particles in the known universe. Yeah. I just calculated that in my head, haha" - Erik
@andreportaro4 жыл бұрын
42:40 Just want to applaud at an amazing explanation and demo 👏
@TheFootballPlaya3 жыл бұрын
this guy is the man. his lectures are awesome.
@rohitsurana92817 жыл бұрын
Thanks MIT and Eric.Best teaching that too for free.
@chanpol3217 жыл бұрын
Time and space complexity[edit] The time complexity can be expressed as O ( | V | + | E | ) {\displaystyle O(|V|+|E|)} ,[5] since every vertex and every edge will be explored in the worst case. | V | {\displaystyle |V|} is the number of vertices and | E | {\displaystyle |E|} is the number of edges in the graph. Note that O ( | E | ) {\displaystyle O(|E|)} may vary between O ( 1 ) {\displaystyle O(1)} and O ( | V | 2 ) {\displaystyle O(|V|^{2})} , depending on how sparse the input graph is. When the number of vertices in the graph is known ahead of time, and additional data structures are used to determine which vertices have already been added to the queue, the space complexity can be expressed as O ( | V | ) {\displaystyle O(|V|)} , where | V | {\displaystyle |V|} is the cardinality of the set of vertices (as said before). If the graph is represented by an adjacency list it occupies Θ ( | V | + | E | ) {\displaystyle \Theta (|V|+|E|)} [6] space in memory, while an adjacency matrix representation occupies Θ ( | V
@soonshin-sam-kwon Жыл бұрын
Very clear and intuitive 💎 Thanks for sharing this invaluable resouces! Big shout out to MIT 🔥🎓
@gnulinux20002 жыл бұрын
Absolutely must watch, adding where they are used and application gives good perception which otherwise made graph dry subject for me.
@devyashsanghai5857 жыл бұрын
Love the way he is wearing a t-shirt with 5 vertices and and 5 directed edges. Whcih would require a space complexity of O(10) to be stored.
@m.yousafjaved60397 жыл бұрын
undirected ?
@naviseven56977 жыл бұрын
It's a reference from a rock paper scissors game from the big bang theory, so it is directed.
@le0nz3 жыл бұрын
So 0(1)
@lifanzhong9782 Жыл бұрын
Thanks for the wonderful lectures Erik!
@yl44413 жыл бұрын
Thank you so much for posting this video!!! Its too hard to find videos explain algorithms clearly and easy to understand.
@panagiotistzakis6799 Жыл бұрын
Amazing lecture sir and of course your are from MIT because your level of knowledge is very high!!Thanks for your time..
@nbro55299 жыл бұрын
Erik Demaine - "...but in the textbook, and I guess in the world..." lol
@robertalaverdyan31504 жыл бұрын
Wonderful. I wake up watching these lectures and sleep watching them.
@Uber_handle3 жыл бұрын
The grind!
@vedient5 жыл бұрын
Lectures like this make me feel how lucky MIT students are !!!
@hortsss4 жыл бұрын
@@SimonWoodburyForget but I think the point is to just give students an introduction of the subject so they can work on real problems
@theendurance3 жыл бұрын
@Simon WoodburyForget Because you are forgetting that Computer Science is a...science. CS is not programming. Programming is monkey work. Algorithms are at the heart of CS. You don't need code because this isn't meant for practical uses. CS is just math for computers.
@josh545 жыл бұрын
Wish my professor wasn't lazy and wrote all the notes on the board like this instructor. I can't keep up with half-assed powerpoints that my professor rushes through
@HanifCarroll4 жыл бұрын
I don't know if he gave you guys the powerpoint slides, but if he did, then you wouldn't have to spend time copying them down because you'd know you would get them. That way, you can spend time writing down the things that will be more helpful for you.
@David-kx3xf3 жыл бұрын
Mine used wolphram mathematica live, and it was an absolute mess 🤦🏻♂️
@hnupadhyaya4 жыл бұрын
Dear all, In this lockdown stage in home, please provide game equipments to your children/students to play. If not help them to watch "Math Art Studio" in you tube. They will play with their names and learn different concepts in mathematics.Those who have seen it they have learnt maths and enjoyed its beauty every day.
@RICHUNCLEPENNYBAGS7710 жыл бұрын
Clear. I read the chapter corresponding to this in the Algorithm Design Manual but I wasn't feeling like it really all came together but this did it for me.
@LiSek96113 жыл бұрын
great lectures, thank you for uploading this
@kordaler Жыл бұрын
Here are points in other videos in this course's playlist that explain terms used in this video: - represent graph in Python: watch?v=5JxShDZ_ylo&t=1709s - adjacency list in Python: watch?v=C5SPsY72_CM&t=189s - examples of theta, O, omega: watch?v=P7frcB_-g4w&t=130 - what is hashing: watch?v=0M_kIqhwbFo&t=22 - python implementation of iterator: watch?v=-DwGrJ8JxDc&t=978 I found this useful. Hope some of you find it useful as well. If you find more terms for which I can add pointers, let me know. If a few people think that this is useful, I can add this information for a few more videos. If you are looking for this info in any specific videos, let me know. If I have made these notes for those videos, I will add. Cheers!
@solwex Жыл бұрын
Very useful. Would be more convenient if the link was properly given.
@dpydys2 жыл бұрын
Thank you for a very clear explanation.
@rafiaqutab81749 жыл бұрын
You are such an amazing teacher! I wish I had you in college
@ru2979 Жыл бұрын
I wish I had u 🥺👉👈
@solwex Жыл бұрын
Simply evergreen content!!
@SaiVineet10 жыл бұрын
This guy is so cool!
@ReaRalte9 жыл бұрын
Better than my College's class, thumbs up.
@lockersrandom61613 жыл бұрын
Thank You MIT.
@gaganb3 жыл бұрын
I can smell the chalk dust through the video. Takes me back, great stuff.
@alexandrugheorghe56103 жыл бұрын
Don't understand why people complain about the chalk. As he writes down so am I doing in my notebook and I find this to be working very smoothly [especially as I can pause the video and also think for myself and try to prove what he said] - I'm getting most of what he says - less so to get a proof on the spot for n x n x n - but hey, he published a paper with et al. on this subject so :) that's accessible for later.
@carlosseda56192 жыл бұрын
Amazing explanation, thank you!
@ariadnel58096 жыл бұрын
Thank you this video is a great help.
@sujivsontitus54639 жыл бұрын
May be the camera person should consider finding a balance between landscape and portrait shooting, instead of taking the actions in portrait always. It gets difficult to see the contents in the board with the staff, since the focus is set to one "focussed" part of the black board. This is just my thought. btw MIT rocks!
@MaicahRu8 жыл бұрын
Sujivson Titus True, a little frustrating when he's pointing at something but it's off the screen, or you're reading through something but part of it is cut off
@musfiqniazrahman10 жыл бұрын
it's, in fact, from 34:14
@rashedsami19596 жыл бұрын
Erik Demaine
@MetallicDETHmaiden5 жыл бұрын
Great video!! learned a ton!
@Zero-bl6ym7 жыл бұрын
Eric is great!
@MrWhileloops5 жыл бұрын
Excellent lecture.
@MarzukiSondoss10 жыл бұрын
Das is fantastisch! vilen dank
@wetbadger21743 жыл бұрын
How do you feed a graph into this method? I hate when people don't show the whole code. Is the adjacency list supposed to be a dictionary/hashtable?
@KaisarAnvar Жыл бұрын
His T-Shirt: Scissors cuts paper, paper covers rock, rock crushes lizard, lizard poisons Spock, Spock smashes scissors, scissors decapitates lizard, lizard eats paper, paper disproves Spock, Spock vaporizes rock, and as it always has, rock crushes scissors.
@ruchirmumbarkar87584 жыл бұрын
Thank you! His t-shirt also has graph on it!
@devmahad Жыл бұрын
[FOR MY REFERENCE] 1) Graph Applications 2) Graph BFS Algo. 3) Time Complexity
@zlw88445 жыл бұрын
Erik is the best teacher who explains data structure and algorithms so clearly and in a simple way.
@user-on6nm4ex2q6 жыл бұрын
What does "24 symmetries of the cube" refer to?
@adityatrivediii4 жыл бұрын
Thanks! Nicely Explained
@jakefischer82813 жыл бұрын
I like the way he writes.
@sasikaroledenez75158 жыл бұрын
what is the reference book align to this course ?
@mitocw8 жыл бұрын
The required textbook for this course is: Cormen, Thomas, Charles Leiserson, Ronald Rivest, and Clifford Stein. Introduction to Algorithms. 3rd ed. MIT Press, 2009. ISBN: 9780262033848. (www.amazon.com/exec/obidos/ASIN/0262033844/ref=nosim/mitopencourse-20) See the course on MIT OpenCourseWare for more information and materials at: ocw.mit.edu/6-006F11
@David-kx3xf3 жыл бұрын
There are two ways to study algorithms: the MIT way, or the hard way
@allene_3 жыл бұрын
yay MIT lecture in my room
@bhaveshgupta384610 жыл бұрын
what if i want to know all the shortest paths to a node in the example that is there in this lecture! for example there might my exponentially many ways to get to node f from s. and there might be many shortest paths.But BFS gives us only one! i want to know the no. of all the shortest paths between two nodes s and f. How can I achieve this?
@user-my3yg3nz8r2 жыл бұрын
This is amazing.
@csvegso3 жыл бұрын
he is a great teacher
@VivekTiwari03 Жыл бұрын
Man I feel smarter just by sitting here even though I have no clue what happened in those 50 minutes.
@parattakornchaisiriyanon22535 жыл бұрын
Awesome Teacher
@aishsagar10 жыл бұрын
for n x n x n rubic cube, looks like the solution would be 2^(n+1)+n+1. based on 2x2x2 and 3x3x3 values. is it right?
@tehleelmir44072 жыл бұрын
Thank YOUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUU, it took me 3 days to understand how to track the path in bfs
@user-jh4dj1ef4d2 жыл бұрын
30:40 BFS 14:44 bookmark
@Jbdoster4 жыл бұрын
I had a great laugh around 19:00, thank you
@spontaneoushorts8 жыл бұрын
:O its amazing then my whole CIT department
@90336640447 жыл бұрын
Can Someone explain how the number of possible states is derived for 2*2*2 cube?
@shivammalviya17185 жыл бұрын
Thank you very much sir
@goodnis61808 жыл бұрын
thank you
@onurduygu32813 жыл бұрын
Thank you Eric! Eric choupo moting
@niharpatil40467 жыл бұрын
How are there 24 possible symmetries?
@StevenMcconnon11 жыл бұрын
thanks!
@mathewkizhakkadathu30643 жыл бұрын
What is U in relation to V at 22:07?
@PeterParker-hm7ub3 жыл бұрын
this is gold
@wthered7 жыл бұрын
I love his T-shirt!!!!
@benaya65 жыл бұрын
amazing lecturer. Mr. cameraman, please dring cofee or something and keep up
@MrTacoToy4 жыл бұрын
Cameraman did a good job of knowing when we'd rather look at the board than him walking.
@erics.41133 жыл бұрын
This makes me think about the extraordinary gap in intellect between human beings.
@monatabuk11 жыл бұрын
thanks
@MuhammadHassan-lu4ox4 жыл бұрын
That hip movements at @5:02
@shabananisha19119 жыл бұрын
thank u sir ...
@isbestlizard3 жыл бұрын
I've always wanted to know HOW a rubics cube is actually mechanically put together that it allows so much random rotation of everything without breaking or getting gummed up. :O
@user-cs6dj1bd9b6 жыл бұрын
At 34:13, if anyone cares to change the subtitles from (INAUDIBLE), what he says sounds like "pseudocode".