Hi
I have the following problem. I have a function that generates 5000 numbers
of 64 bits in Hex. The idea is, once generated the 5000, to count the amount
of times that each one repeats and to give me the number of greater
appearance with the amount of appearances. I've tried with an unsigned long
matrix y[3] [5000], in where and y[0] [i] and y[1] [i] keeps 32 bits each
one and y[2] [i] stores the amount of times that appears. But it is not
working to me, probably by the amount of data.
Some idea?
Thank you very much
Greetings
Pablo
|