The majority vote program ( discussed a couple of days ago ) would work in this case I think. In the end we would have the modal element with count = 0 (n - n ). Please correct me if I am wrong.
On Sat, Sep 11, 2010 at 3:00 PM, bittu <shashank7andr...@gmail.com> wrote: > Given an array of 2n elements of which n elements are same and the > remaining n elements are all different. Write a C program to find out > the value which is present n times in the array. There is no > restriction on the elements in the array. They are random (In > particular they not sequential). > > -- > 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<algogeeks%2bunsubscr...@googlegroups.com> > . > 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 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.
