MIT's Introduction to Algorithms, Lecture 3: Divide and Conquer

You're viewing a comment by mave and its responses.

mave Permalink
November 09, 2008, 03:20

Hi, i saw this question on the other post on Order Statistics, can someone help answer this question

Let X[1::n] and Y [1::n] be two arrays, each containing n numbers already in sorted order.
Give an O(lg n)[in other words an algorithm better than O(n) ] time algorithm to find the nth smallest element of the 2n elements in arrays X and Y, using divide & conquer

Thanks!!

Reply to this comment

Comment Responses

Mahmood Permalink
March 28, 2011, 18:30

did you get the answer?.If yes,tell me because I have interest in your question?
I know It is very late to ask!

Reply to this comment

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 first 3 letters of your name: (just to make sure you're a human)

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