`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)
Difficulty	Beginner (index: 2 / 10)

Concepts¶

Beta Feature

This concept detection system is still in beta and may occasionally show incorrect or incomplete results.

Recursion
Pointers
Iteration

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);
}

Explanation¶

Explain with AI

Copy the prompt below and paste it into any AI assistant.

    You are explaining a C programming code to a beginner.

    STRICT RULES:

    - Only use the given code. Do NOT assume anything not present.

    - Do NOT add extra examples.

    - Keep explanation clear and short.

    - If something is unclear, say "Not clear from code".

    - Follow the exact format below. Do NOT change headings.

    FORMAT:

    [START]

    ## What it does

    (Explain the overall purpose in 1-2 sentences)

    ## Step-by-step

    (Explain how the code works in steps, simple language)

    ## Key Concepts

    (List concepts like loop, condition, function, etc.)

    ## Notes

    (Mention any limitations, errors, or assumptions)

    [END]

    CODE (luc049.c):

    #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);
    }

luc049.c¶