Skip to content

luc049.c

Problem Statement

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

Metadata

Property Detail
Author Amit Dutta amitdutta4255@gmail.com
Date 08 Feb 2026
License MIT License (See the LICENSE file for details)

Actions

Raw View on GitHub

💡 You can print or save this file by opening Raw and using your browser.

Source Code

#include <stdio.h>
#include <math.h>
#include <stdlib.h>

int binary_non_rec(int);
void binary_rec(int);

int main()
{
    int num, bin;

    printf("Enter a positive integer: ");
    scanf("%d", &num);

    bin = binary_non_rec(num);
    printf("Binary (Non-Recursive): %d\n", bin);

    printf("Binary (Recursive): ");
    binary_rec(num);
    printf("\n");

    return 0;
}

int binary_non_rec(int n)
{
    int rem, i = 1, bin = 0;
    while (n != 0)
    {
        rem = n % 2;
        n = n / 2;
        bin = bin + rem * i;
        i = i * 10;
    }
    return bin;
}

void binary_rec(int n)
{
    if (n > 1)
        binary_rec(n / 2);

    printf("%d", n % 2);
}