To figure out how many times each number occurs you basically have to run through the entire array and 'note' the occurrances. For example if your array consists of numbers between 0 and 9. You could make 10 variables of type int initialized to 0: a,b,c...i,j. where a corresponds to 0, b to 1, and so on. As you are running through the array, you check the number, if it's 1, you increment b; if its 3, you increment d, and so on. When you're done with the array you will have the 10 variables that have a count of how many times the corresponding number appears in your array. This is somewhat messy though. An alternative approach would be to utilize a two dimensional array in place of the 10 variables, which would clean it up a bit - especially if you dont know ahead of time what numbers to expect in your array and have to deal with whatever number is presented (for example if the number 13 is found, how do u deal with that?). Does this help?