use hash table , and if you find for a number , a entry already exists , mark it unwanted ! in the end , hash table entries are unique numbers .
@kunzmilan : could you explain a bit more, couldn't get full idea of what you wrote -Manish On Jun 14, 1:19 pm, kunzmilan <[email protected]> wrote: > Write the array as a vector string S, eg > (1,0,0,0...) > (0,0,1,0...) > (0,0,0,1...) > etc. > Find the quadratic form S^T.S. On its diagonal, occurences of all > numbers are counted. > kunzmilan > > On 13 čvn, 20:44, 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]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
