@ arpit please elaborate din get you ......
On Mon, Feb 7, 2011 at 8:16 PM, arpit busy in novels <
arpitbhatnagarm...@gmail.com> wrote:
> @ spark , hi
> i think either a[0,0] or a[n,n] will be the largest element
>
> we need one more step to test which one is biggest & then apply my algo:
>
>
> I just though we should apply merge sort < mean merge 2 array into one )
>> on 1st row & 1st column <this will be accurate since rows & columns r
>> Sorted) next we move down the diagnol 1 step & apply the same merge sort
>> n so on < cant say much abt complexity but it feels effective)
>>
>>
>>
>> for (i=0,j=0;i<n& j<n)
>> {
>> k[]=merge ( a[0,0] row & column)
>> i++,j++;
>> }
>>
>>
>
>
> --
> Arpit Bhatnagar
> (MNIT JAIPUR)
>
> --
> 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?hl=en.
>
--
With Regards,
*Jalaj Jaiswal* (+919019947895)
Software developer, Cisco Systems
Final Year Undergraduate,
IIIT ALLAHABAD
--
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?hl=en.
