@dufus
lokking at your soln of young tableau
i think there is a problem of repition of some number
given
array A={1,2,3,4}
array B={2,3,4,5};
and try to look wat i say..
3 will repeated , 4 , 5 and so on..
On Sat, Sep 5, 2009 at 12:35 PM, Dufus <rahul.dev.si...@gmail.com> wrote:
>
> It seems EXTRACT_MIN for Z[n^2] can be done in O(n) time.
> http://lyle.smu.edu/~saad/courses/cse3358/ps5/problemset5sol.pdf<http://lyle.smu.edu/%7Esaad/courses/cse3358/ps5/problemset5sol.pdf>
>
> Then using it we can find the kth smallest element in O(nk) time.
>
> _dufus
>
>
> On Sep 4, 10:03 pm, ankur aggarwal <ankur.mast....@gmail.com> wrote:
> > Find nth smallest inO(n) Given two arrays of length n in sorted order
> > X[n] & Y[n].
> > Now make another array Z[n^2]={such that z belongs to X+Y}.
> > AS all possible sum of x+y is there in Z. You have to give the nth
> smallest
> > no of Z in O(n) time.
> > Space complexity : No bound on it. But try to optimize it if possible.
>
> >
>
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algogeeks@googlegroups.com
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/algogeeks
-~----------~----~----~----~------~----~------~--~---
