I post you 2 problems
First:
There are two N x N arrays which are sorted by row and column.
The problem is to find efficiently a N x N array from the two such that
the resultant array is sorted by row and column and it should contain
the
N^2 elements which are least of all 2N^2 elements in the
Please see the answers below.
Gene wrote:
> krisp wrote:
> > I am looking for an efficient algorithm to search for k-median across
> > disjointed vectors.
> >
> > For example, I have 10 different size arrays of floats (size varies
> > from 20k to 100k elements) from which I would like to get 100
thank you all guys for suggesting me a book.
--~--~-~--~~~---~--~~
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,
Hi
U can go for Tennanbaum...
On 7/24/06, gupta <[EMAIL PROTECTED]> wrote:
hai frnz...this is gupta, student of iitm doing masters in non csc background. iam very new for this group.
frnz, i much interested in learning programming language(C++)... so cauu suggest me a good book for DATA STR
