the quadinary search will work well for this problem...
step 1 : divide the matrix into 4 almost equal quadrands.... step 2 : being row wise sorted and column wise sorted the smallest value will be at the top left and largest value will be at the bottom right... if the value to be searched is within the range between largest and smallest recursively perform step 1 until 2x2 matrix .... step 3: if it 2X2 matrix search the element individually.. complexity of this algorithm will be log4(n*m), -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
