xor all the elements. Similar elements would become 0. Remaining would be unique element.
On Mon, Jun 14, 2010 at 12:14 AM, jalaj jaiswal <[email protected]>wrote: > give an algo to find a unique number in an array > > for eg a[]={1,3,4,1,4,5,6,1,5} > > here 3 is the unique number as it occur only once... moreover array > contains only 1 unique number > > > > -- > With Regards, > Jalaj Jaiswal > +919026283397 > B.TECH IT > IIIT ALLAHABAD > > -- > 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]<algogeeks%[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.
