after a bit analysis i stick strongly to my soln :::::
0 1 2 3 since element of last row & column will
always be greater than rest of array
2 2 3 4
3 3 4 5
4 5 6 7 take 7654 as 1st & 7543 as 2nd merge them
as k[]
array reduced to
0 1 2
2 2 3
3 3 4 take 433 as 1st 432 as 2nd
merge them as l[]
0 1
2 2 22 & 21 as m[]
merge all k[] m[] l[] add least element always a[0,0]
..........................................hope this is clear least on my
side
--
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.
