[algogeeks] Re: determine whether a matrix is rearrangeable

Sun, 19 Mar 2006 10:38:31 -0800

Hi..frns...
here algorithms for this problem...

1st assume each row contains only 1.

   store the position of 1's in each row in one dimensional array.
  and use hash technique ..[ this is for to know whether any row is repeated or not ] if two numbers repeated....
           this is not rearrangble matrix.

1 2 3
4 2 1
2 1 4

stored array is 0 2 1      this is not contains any repeated elements... i.e it is rearrangble.

if any row contains more than 1 1's the difficulty arises in algo...if we manage that like this....
O(n2) is complexity....to find this....
             



On 3/19/06, SPX2 <[EMAIL PROTECTED]> wrote:


--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---

Reply via email to