i think this can be done much faster similar to findling median of two
sorted arrays by proceeding with comparing medians of two arrays and then
reducing the data set to approx 3/4th of 2n. I am looking for that algo if
osmeone have.
Best Regards
Ashish Goel
"Think positive and find fuel in failur
to find kth largest element in the 2 sorted array can be done by simple
merge...
obv no need for extra space...two indexes will do.
you just need to check arr1[i...n] == arr2[j..m]
if(arr1[i] > arr2[j])
{
cnt++;
index=arr2[j];
j++;
}
else
{
cnt++;
index=arr1[i];