Best Answer

int bitcount (unsigned n)

{

int bitc= 0;

while (n) {

++bitc;

n = n&(n-1);

}

return bitc;

}

Q: Write a c plus plus program that counts the no. of 1 bit in a given integer?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

165

Yes, do write, or if you're too lazy to your homework, use google.

Multiply the numerator (top) and the denominator (bottom) of the given fraction by any non-zero integer. You will have an equivalent fraction.

It is a whole number which is another name for an integer.

This is a homework assignment. write your homework assignments for you because you have been given them so that you learn the skills you will need in life. However, if while doing this assignment you have specific things you need help to understand WikiAnswers will be happy to answer these specific questions for you.

Related questions

program to extract a given word from a file

It is your face

write a shell program for finding out gcd of three given numbers? write a shell program for finding out gcd of three given numbers? write a shell program for finding out gcd of three given numbers? check bellow link http://bashscript.blogspot.com/2009/08/gcd-of-more-than-two-numbers.html

write the javascript code to display the reverse no. of given no. (e.g. 247 reverse of 742)

Given the prime factorization of an integer how can you determine if our integer is a perfect square?

#!/bin/sh wc -lw "$1"

there could be a part in it like this: int num, digit; int count [10]; do { digit = num%10; num != 10; ++count[digit]; } while (num);

Assuming the number is represented by a decimal integer, initialise a counter to zero, then repeatedly divide the number by 10 and until the number is zero. After each division, examine the remainder. Each time the remainder is zero, increment the counter. If the number is represented by a decimal float, repeatedly multiply by 10 until the value is an integer, then perform the previous algorithm.

No.

165

Yes, do write, or if you're too lazy to your homework, use google.

Multiply the numerator (top) and the denominator (bottom) of the given fraction by any non-zero integer. You will have an equivalent fraction.