Count Set Bits in an Integer

Solving Approach

How do you plan to solve it?

Code

#include <stdio.h>

int countSetBits(unsigned int n) {
	int turns = 0;
	while(n > 0){
		if (n & 1){
			turns++;
		}
		n = n >> 1;
	}
	return turns;
}

int main() {
	int n;
	scanf("%d", &n);
	printf("%d", countSetBits(n));
	return 0;
}