http://www.cs.utexas.edu/~moore/best-ideas/mjrty/index.html
On Nov 7, 3:12 am, lichenga2404 <lichenga2...@gmail.com> wrote: > There are many secret groups in College A.Every student at college A > is a member or these secret group, though membership in one excludes a > student from joining any other group. You wish to determine if any one > of these groups contains more than half of the student population. To > achieve this , you will introduce 2 students to each other: if they > are members of different group , they will smile. If different group , > they will nod. How to determine if any one group has more than half of > the student population as members in O(n) introductions . And justify > the answer. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
