Greedy Algorithm: Sort descending elements using the following order: A & B are the concatenation of A and B. Following Set the order relation Between the numeric strings A <B iff A & B <B & A
Concatenate all elements in this order set. To show the correctness of this algorithm need to show that this relation < is a total order. The relationship is clearly anti-symmetric and total. It remains to show the transitivity Can anybody show that transitivity of this particular order? Wladimir Araujo Tavares *Federal University of Ceará * On Mon, May 30, 2011 at 10:07 AM, Bhavesh agrawal <[email protected]>wrote: > @piyush : > > hey buddy, check out carefully i think you missed something. > > my solution says it's 18 ->18111 > 187->18711 > and i think you will count it carefully... > > plz let me know in any case if my solution goes wrong anywhere . > > > > -- > 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. > -- 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.
