Lec 3 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005

[1sanjaygir1]

3:53 me too. 

[lovelplants]

very nice teacher.. i like the way it being explained.

[eboyjr14]

The algorithm he says is "completely impractical" at 54:30 is called the Coppersmith–Winograd algorithm. The running time is O(n^2.376). However, the constant coefficient hidden by the Big O notation is so large that the Coppersmith–Winograd algorithm is only worthwhile for matrices that are too large to handle on present-day computers.

As a side note: Since any algorithm for multiplying two n×n-matrices has to process all 2×n2-entries, there is an asymptotic lower bound of Ω(n^2) operations.

[AdrianGordon1231]

sooo confusing

[maymeewi]

Nice lecture, but he is always in such a hurry, writes fast and seems stressed it makes me anxious. I want to tell him "chill!!"

[sarbasov]

What a damn chalk sound on 47:33

[sarbasov]

20:43 - he could not even explain well enough what fibonacci sequence is.

[AJSwisgirl]

American lectures are like rappers... body language , hand gestures are funny.

[wdlang06]

i can not believe that the naive matrix multiplication can be improved

i do not think there is any waste in the naive algorithm

[classicrockonly]

Only in Algebra 2 at my High School, but I think I'm excited to learn algorithms. :)

[zyxgrubby]

Way faster than the stream on its official site. Thx for uploading!

[PolliporeMellite]

00:24 that's it, I'm fed up with algorithms. I quit.

[mycranberries]

VLSI layout is cool!

[firemanliu]

it looks like the teachers in the top school gonna try their best to explain things as simple as they can, like recursive code is bad,and dynamic program is good.

btw,i wonder what kind of sick person will make zero as the answer of all questions,

[salamsoftyt]

thx for posting

[1reaper2]

Thanx for posting

[nibauAntunes]

very good thank you great lectures

[OrzSTO]

this is the best

[d3leterious]

"this is the best"

Then who rated this video with a one-star?

Rate it 5-stars then.