[algogeeks] Re: Permutation Alogrithm very slow

2006-04-18 Thread kensuke
Why do you need to do all the permutation? if you have 7 users, you need only 7 permutations, not 2**100. --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to

[algogeeks] Re: right-convertible tree

2006-04-18 Thread pramod
Yes, I agree. In fact we can take the simple example here. T1's root is 2, left of root 1 and right of root 3. Let T2's root be 3, left of root 1 and right of 1 be 2. There's no way we can get T2 from T1 using right rotations. But if given that T1 with 'n' nodes can be converted to T2, in the

[algogeeks] code for finding suport function

2006-04-18 Thread sunayana
Hello, Does anybody have a program/algorithm about finding a support function of any given planar curve? thanks --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send

[algogeeks] Re: Permutation Alogrithm very slow

2006-04-18 Thread adak
You've hit the problem right on the head, kensuke. I believe he wants to give each viewer not just a random display from the database, but a display that won't be repeated, as well. Checking the random numbers off against a boolean array, would give him what he wants, (together with your