Interested to Buy Any Domain ? << Click Here >> for more details...
What is the most efficient way to count the number of bits
which are set in a value?
- 4 Answers
- 15119 Views
- I also Faced
- E-Mail Answers
Answer Posted / venkat1435
main()
{
int n,count=0;
printf("enter a number");
scanf("%d",&n);//enterd no.is 5
while(n>0)
{
count++;
n=n&n-1;//binary of n is 101
// binary of n-1 is 100
//n&n-1 is (i.e 101
&100 =100 )
}
printf("%d",count);
getch();
} output is 2(i.e 2 ones in 101)
| Is This Answer Correct ? | 31 Yes | 6 No |
Post New Answer View All Answers
Explain what does it mean when a pointer is used in an if statement?
What is the c value paradox and how is it explained?
What is the use of a conditional inclusion statement in C?
In this assignment you are asked to write a multithreaded program to find the duplicates in an array of 10 million integers. The integers are between -5000,000 to 5000,000 and are generated randomly. Use 10 threads, each thread works on 1000,000 integers. Compare the time needed to accomplish the task with single thread of execution program. Do not include the time to fill the array with integers in the execution time.
Explain the use of 'auto' keyword in c programming?
In C, What is the #line used for?
Write a C++ program to generate 10 integer numbers between - 1000 and 1000, then store the summation of the odd positive numbers in variable call it sum_pos, then find the maximum digit in this variable regardless of its digits length.
Why enum is used in c?
What are the advantages of Macro over function?
How can you find out how much memory is available?
Why is c so powerful?
What is non linear data structure in c?
What is scope of variable in c?
What is volatile, register definition in C
What is wrong with this initialization?
