Interested to Buy Any Domain ? << Click Here >> for more details...
how do u find out the number of 1's in the binary
representation of a decimal number without converting it
into binary(i mean without dividing by 2 and finding out
the remainder)? three lines of c code s there it
seems...can anyone help
- 5 Answers
- 9853 Views
- I also Faced
- E-Mail Answers
Answer Posted / krishna
The above solutions will not work for negative numbers.
if a negative number is right shifted, the most significant bit will become 1. so the number never becomes zero.
The following will work for both +ve and -ve numbers.
#include <stdio.h>
int main(int argc, char *argv[]) {
int count = 0;
int no = 3;
int x = 0x01;
if ( argc > 1) {
no = atoi(argv[1]);
}
while ( x != 0) {
if( no & x ) {
count++;
}
x <<= 1;
}
printf( "number: %d , no.of 1s in it: %d\n", no, count);
return 0;
}
| Is This Answer Correct ? | 1 Yes | 2 No |
Post New Answer View All Answers
What is the g value paradox?
Explain the process of converting a Tree into a Binary Tree.
What is calloc()?
What are linked lists in c?
What are the 5 organizational structures?
What are identifiers c?
For what purpose null pointer used?
How does #define work?
Is it possible to use curly brackets ({}) to enclose single line code in c program?
how to print electricity bill according to following charges first 100 units -1rs per unit for next 200 units-1.50 rs per unit without using conditions
What does d mean?
What is malloc calloc and realloc in c?
What is an lvalue?
Why array is used in c?
What is meant by recursion?
