Lec 6 | MIT 6.046J / 18.410J Introduction to Algorithms (SMA 5503), Fall 2005
Top Comments
All Comments (9)
-
very GOOOOOD :)
-
@safsfsfdfgdg The key is finding the pivot in O(n) recessively. Since when you use randomized way, you may get some unlucky pivot; so they try to take an O(n) as a cost to find the pivot, and the finding ith element still cost O(n). Hope this explain helps.
-
How is finding median of medians O(n) ? There are n/5 elements and we need to find the median amongst them. Won't you apply random select there with k=n/10? The proof contains a similar subproblem which we are assuming to be O(n)
-
@NANDINIGOEL bottom left and top right is correct because the notation a->-b says a < b. So here as per the diagram vertically its descending order and horizontally its ascending order. So it is right.
Kinda tricky because of the way arrow marks are drawn.
-
@NANDINIGOEL right
-
the boxes drawn were wrong, they should be the other two i.e. left top and right bottom
great!
nibauAntunes 2 years ago 6