@ shashank and all can we an approach that take less time than O(N^2). I mean not in O(N ) or nlogn but <n^2 some optimiation On Thu, Aug 25, 2011 at 8:43 PM, WgpShashan) k <[email protected]> wrote:
> @Sharvan ..Yes We Can do That and yes i forgot that intead of > locals.add(a[i][j]) , we need tow write locals.add(i+j) Hope its fine now > :) > > > > > *Thanks > Shashank Mani > Computer Science > Birla Institute of Technology Mesra* > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/FKYupw3YSG4J. > > 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. > -- 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.
