Q11 A positive integer is entered through the keyboard, write a function to find the binary equivalent of this number: (1) Without using recursion (2) Using recursion

A positive integer is entered through the keyboard, write a function to find the binary equivalent of this number: (1) Without using recursion (2) Using recursion

Program: 132

A positive integer is entered through the keyboard, write a function in c language to find the binary equivalent of this number:

(1) Without using recursion
(2) Using recursion

How to use recursion to get the binary digit using decimal number.

#include<stdio.h>
int non_rec_bin(int num);
int rec_bin(int num);
void main()
{
    int num;
    printf("Enter Number: ");
    scanf("%d", &num);

    printf("Decimal To Binary Using Recursion: %d", rec_bin(num));
    printf("\nDecimal To Binary Without Using Recursion: %d", non_rec_bin(num));
}
int non_rec_bin(int num)
{
    int x, res=0, pos=1;
    while (num!=0)
    {
        x = num%2;
        res = res + (x*pos);
        pos = 10*pos;
        num = num/2;
    }
    return res;
}
int rec_bin(int num)
{
    if(num==0)
    {
        return 0;
    }
    else
    {
        return ((num%2)+10*rec_bin(num/2));
    }
}

Output:

Enter Number: 10
Decimal To Binary Using Recursion: 1010
Decimal To Binary Without Using Recursion: 1010

Lokesh Kumar: Being EASTER SCIENCE's founder, Lokesh Kumar wants to share his knowledge and ideas. His motive is "We assist you to choose the best", He believes in different thinking.
Related Post
Leave a Comment

This website uses cookies.