MIT's Introduction to Algorithms, Lecture 6: Order Statistics

You're replying to a comment by abc.

abc Permalink
September 16, 2008, 19:04

Can anyone answer the below question for me pleas??

Let X[1::n] and Y [1::n] be two arrays, each containing n numbers already in sorted order.
Give an O(lg n) time algorithm to find the nth and n+1st largest elements of the 2n elements
in arrays X and Y . Your algorithmic description must start with a brief overview of your
algorithm in English.

Reply To This Comment

(why do I need your e-mail?)

(Your twitter name, if you have one. (I'm @pkrumins, btw.))

Comment Help

Type the first letter of your name: (just to make sure you're a human)

Please preview the comment before submitting to make sure it's OK.