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

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
26,235
Loading...
Alert icon
Sign in or sign up now!
Alert icon
There is no Interactive Transcript.

Uploaded by on Jan 7, 2009

Lecture 06: Order Statistics, Median

View the complete course at: http://ocw.mit.edu/6-046JF05

License: Creative Commons BY-NC-SA

More information at http://ocw.mit.edu/terms

More courses at http://ocw.mit.edu

Category:

Education

License:

Standard YouTube License

  • likes, 3 dislikes

Link to this comment:

Share to:

Top Comments

  • great!

see all

All Comments (9)

Sign In or Sign Up now to post a comment!
  • 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

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more