13. Breadth-First Search (BFS)

27
4



MIT 6.006 Introduction to Algorithms, Fall 2011
View the complete course:
Instructor: Erik Demaine

License: Creative Commons BY-NC-SA
More information at
More courses at

Nguồn:https://baovnexpress.com/

27 COMMENTS

  1. "There are more configurations in a 7*7*7 cube than the number of particles in the known universe" 27:35
    – Erik Demaine (2011)

  2. 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.

  3. Why in the world would someone write on a chalk board in the year 2019. The lecture slows down by (n * t) where n = number of characters written and t is the time taken to write each character. SMH.

  4. 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

  5. Maybe someone can help me:
    I'm from Brazil and I study CS. I noticed that in Introduction to Algorithms ppl there already knows algorithm analysis, study graphs and this kind of stuff. Here we just learn the basics (we start with C, since the basics of the language till structs and we see a bit of divide and conquer, sorting (qsort, merge, and the n^2 algorithms) and we work with matrix and files (bin and text). Then in the second year we study design and analysis of algorithms, which is when we learn algorithms analysis and paradigms like dynamic programming, divide and conquer (deeply), greedy algorithms and so on. Now I'm in the third year and I'm studying graphs. Id like to know if the students dont get confused by studying these kind of stuff early (and if they actually study it early cuz I don really know if this assignment is a 1st year assignment)

  6. 13:03 How does one show that the cube has 24 symmetries, and that only a third of the configuration space is reachable?
    These papers have answers:
    https://web.mit.edu/sp.268/www/rubik.pdf
    http://www.math.harvard.edu/~jjchen/docs/Group%20Theory%20and%20the%20Rubik's%20Cube.pdf

LEAVE A REPLY

Please enter your comment!
Please enter your name here