I am writing a program and I need help with a part of it.

Need a recursive function that returns the number of 1's in the binary representation of N. I am using the fact that this is equal to the number of 1's in the representation of N/2, plus 1, if N is odd.

Can anyone assist me. tminott@firstindiana.com