Question

Do not copy from others! Thank you!

Describe the standard algorithm for finding the binary representation of a positive decimal integer

a. in English.

b. in pseudocode.

Answer 1

a)

read the number

loop until the number becomes zero

do number % 2 and store the result in an array

update number value by dividing it by 2 (number=number/2)

end loop

now print the values of array in reverse it is the binary value

--------------------------------------------------------------------------------------------------

b)

#include <stdio.h>

int main()
{
int a[20],i,n;
i=0;
scanf("%d",&n);
while(n!=0)
{
a[i++]=n%2;
n=n/2;
}
i--;//i incremnted but the last value is i-1
while(i>=0)//i is the total length of array now
{
printf("%d",a[i]);
i--;
}

return 0;
}