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

[OctopusMagnetism]

57:00 1/n is just staying WITHIN the single integer "lucky" result. 1/n is a way to to have a thing you can move around and still sort into greater than or less than.

if it affects N then its likely not N, and you would not want to use ones or zeros for the math- just the path.

[OctopusMagnetism]

c'mon guys its just a vote. i know its on video but if youre not that One guy in the front, center- you shoulda voted. this is a good teacher.

42 minutes skin in the game. brilliant.

pivots, correct/incorrect trees, randomized quicksort= guessing lucky with independent runtime input ordering.

[liuzxiao]

If you have some basic knowledge, it a pretty good class!

[sarbasov]

He reminds me Gorbachev without mole.

[hippo42]

I agree with most comments saying that it's hard to follow. This lecturing style is not for me. He spends most time talking and writing, not really illustrating the concepts and ideas. Also, when you have to introduce a lecture by saying it's going to be hard, then you are doing things wrong - just like programming, if you have to comment your code with "this is hard to understand", then please try to make it simpler.

[iBradleyAllen]

yes he is a bad teacher, i already know the material and wanted to review it, the prof here makes this all seem obscure, i cannot follow what he is saying probably because he is going by notes not taking the concepts and teaching them; just because someone is smart doesnt make them a good teacher.

if anyone thinks they cannot follow along? dont blame yourself! maybe i should do a vid on algorithms

[tronulu]

why are there 2 different professors for the same class? O,O

[gcbzzzz]

@QuasarR1 not to mention that he scares everyone with math and then ignores math and invents a solution that he fancys

[cstubing]

I know what you're thinking. "Did he fire six shots or only five?" Well, to tell you the truth, in all this excitement I kind of lost track myself. But being as this is a .44 Magnum, the most powerful handgun in the world, and would blow your head clean off, you've got to ask yourself one question: Do I feel lucky? Well, do ya, punk?

[backlashwave86]

clearly I need to get back to prerequisites

[backlashwave86]

clearly I need to get back to prequisities

[torgausen]

Nothing beats lucky sort. When you actually get lucky, that is.

[caveman0101]

Bubble sort Insertion sort Shell sort

 Merge sort

Heapsort Quicksort Counting Sort Bucket sort

Radix sort

Distribution sort

[sureshkapare]

can i get the details of installation of the board system?

[guerrald]

What a great career path I chose to follow! All I need is a pot of coffee, a jug of ice cold water on the other side, not-so-bright light, and some not-so-loud peaceful music. Now All I need is to turn all these God-given materials into brilliant code/algorithms!

Niiice..

[zobayer1]

me too studying CS!!! really great...

[MrCfaniak]

But... this partition function is a Lomuto idea... Not Hoor'e

[sspoke]

yah quicksort seems like the best sort algorithm.. and all this time I was using swap sort..

[zobayer1]

if you are not going to the linear one's, then merge sort is the best, well, qsort might be an O(n lg n) but it can sometimes touch O(n^2), and merge sort is always O(n lg n).

The quick sort is almost worst when the array is semi sorted...

[hvutrong]

@zobayer1 scramble the array by randomize algorithm first.

[sanshuz]

This is insane this shit.

[sspoke]

seems pretty simple and basic to me.. nothing but programming algorithms

[sspoke]

sounds to me like someone is envious of someone hmm wonder who O.o

[ghuano]

Why is he writing Quick Sort from notes? Every single student of computer science in my country knows it by heart. ;)

[vinillum]

Because rewriting is faster, believe me...

[beefeetr]

because computer science isn't about remembering everything by heart

[dynamiz77]

its about understanding it ;)