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 arrays given. second: Given a N x N array which is sorted by row and column. The problem is to find efficiently the median of N^2 elements. --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
