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/

### Xem thêm Bài Viết:

- Đừng bỏ lỡ cách kích hoạt kích hoạt Win 10 Pro 1709 miễn phí 100%
- Tuyệt chiêu chuyển ứng dụng sang thẻ nhớ j5 Prime trong một nốt nhạc
- Đọc ngay hướng dẫn tải game Battle Realms Winter of the Wolf và cách cài đặt
- Bật mí cách vượt active lock vào màn hình chính iphone 5 hiệu quả
- Bật mí cách tải và cài đặt Steam trên máy tính của bạn hiệu quả nhanh

Thank you MIT for providing these lectures. These are very helpful.

"There are more configurations in a 7*7*7 cube than the number of particles in the known universe" 27:35

– Erik Demaine (2011)

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.

Wonderful. I wake up watching these lectures and sleep watching them.

so 3by3by3 has 3*3 cubies ?? why???

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.

MIT teachers make student love the subject they teach 🙂

every time i see mit open course, that huge chalk always steals mt atention…(love from China )

I had a great laugh around 19:00, thank you

His shirt lol

He starts the section on Graph Traversal around here – https://youtu.be/s-CYnVz-uh4?t=1956

That hip movements at @5:02

Does the 10^80 particles in the known universe include dark matters and dark energies?

Imagine paying for this class just to have it uploaded to youtube for free

It must be 8! * 3^7 and not 3^8 because the positions are relative to a single cubelet.

Thank you very much sir

No comment about the t-shirt then. I am disappointed 🙁

50:40 He could mention what the data structures are for those of us not privileged enough to know python.

2019? April?

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

amazing lecturer. Mr. cameraman, please dring cofee or something and keep up

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)

wait some students don't know the python language ?

Erik is the best teacher who explains data structure and algorithms so clearly and in a simple way.

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

Lectures like this make me feel how lucky MIT students are !!!

I've got bfs code from https://youtu.be/bV-QWuf-0Sg