Decimal to binary conversion without using arithmetic operators

Find the binary equivalent of the given non-negative number n without using arithmetic operators.

Examples:

Input : n = 10
Output : 1010

Input : n = 38
Output : 100110

Note that + in below algorithm/program is used for concatenation purpose.

Algorithm:

decToBin(n)
    if n == 0
        return "0"
    Declare bin = ""
    Declare ch
    while n > 0
        if (n & 1) == 0
            ch = '0'
        else
            ch = '1'
        bin = ch + bin
        n = n >> 1
    return bin

C++

filter_none

edit
close

play_arrow

link
brightness_4
code

// C++ implementation of decimal to binary conversion
// without using arithmetic operators
#include <bits/stdc++.h>
  
using namespace std;
  
// function for decimal to binary conversion
// without using arithmetic operators
string decToBin(int n)
{
    if (n == 0)
        return "0";
      
    // to store the binary equivalent of decimal
    string bin = "";    
    while (n > 0)    
    {
        // to get the last binary digit of the number 'n'
        // and accumulate it at the beginning of 'bin'
        bin = ((n & 1) == 0 ? '0' : '1') + bin;
          
        // right shift 'n' by 1
        n >>= 1;
    }
      
    // required binary number
    return bin;
}
  
// Driver program to test above
int main()
{
    int n = 38;
    cout << decToBin(n);
    return 0;

chevron_right


Java

filter_none

edit
close

play_arrow

link
brightness_4
code

// Java implementation of decimal 
// to binary conversion without
// using arithmetic operators
import java.io.*;
  
class GFG {
      
    // function for decimal to 
    // binary conversion without
    // using arithmetic operators
    static String decToBin(int n)
    {
        if (n == 0)
            return "0";
      
        // to store the binary 
        // equivalent of decimal
        String bin = ""
          
        while (n > 0
        {
            // to get the last binary digit 
            // of the number 'n' and accumulate 
            // it at the beginning of 'bin'
            bin = ((n & 1) == 0 ? '0' : '1') + bin;
              
            // right shift 'n' by 1
            n >>= 1;
        }
          
        // required binary number
        return bin;
    }
  
    // Driver program to test above
    public static void main (String[] args) {
  
    int n = 38;
    System.out.println(decToBin(n));
    }
  
// This code is contributed by vt_m

chevron_right


Python3

filter_none

edit
close

play_arrow

link
brightness_4
code

# Python3 implementation of 
# decimal to binary conversion
# without using arithmetic operators
  
# function for decimal to 
# binary conversion without 
# using arithmetic operators
def decToBin(n):
    if(n == 0):
        return "0";
          
    # to store the binary
    # equivalent of decimal
    bin = "";
      
    while (n > 0):
          
        # to get the last binary
        # digit of the number 'n'
        # and accumulate it at 
        # the beginning of 'bin'
        if (n & 1 == 0):
            bin = '0' + bin;
        else:
            bin = '1' + bin;
          
        # right shift 'n' by 1
        n = n >> 1;
      
    # required binary number
    return bin;
  
# Driver Code
n = 38;
print(decToBin(n));
  
# This code is contributed
# by mits

chevron_right


C#

filter_none

edit
close

play_arrow

link
brightness_4
code

// C# implementation of decimal
// to binary conversion without
// using arithmetic operators
using System;
  
class GFG {
      
    // function for decimal to
    // binary conversion without
    // using arithmetic operators
    static String decToBin(int n)
    {
        if (n == 0)
            return "0";
  
        // to store the binary
        // equivalent of decimal
        String bin = "";
  
        while (n > 0) {
              
            // to get the last binary digit
            // of the number 'n' and accumulate
            // it at the beginning of 'bin'
            bin = ((n & 1) == 0 ? '0' : '1') + bin;
  
            // right shift 'n' by 1
            n >>= 1;
        }
  
        // required binary number
        return bin;
    }
  
    // Driver program to test above
    public static void Main()
    {
  
        int n = 38;
        Console.WriteLine(decToBin(n));
    }
}
  
// This code is contributed by Sam007

chevron_right


PHP

filter_none

edit
close

play_arrow

link
brightness_4
code

<?php
// PHP implementation of decimal 
// to binary conversion without 
// using arithmetic operators
  
// function for decimal to 
// binary conversion without 
// using arithmetic operators
function decToBin($n)
{
    if ($n == 0)
        return "0";
      
    // to store the binary 
    // equivalent of decimal
    $bin = ""
    while ($n > 0) 
    {
        // to get the last binary 
        // digit of the number 'n'
        // and accumulate it at
        // the beginning of 'bin'
        $bin = (($n & 1) == 0 ? 
                          '0' : '1') . $bin;
          
        // right shift 'n' by 1
        $n >>= 1;
    }
      
    // required binary number
    return $bin;
}
  
// Driver Code
$n = 38;
echo decToBin($n);
  
// This code is contributed
// by mits
?>

chevron_right


Output:

100110

Time complexity: O(num), where num is the number of bits in the binary representation of n.

This article is contributed by Ayush Jauhari. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.



My Personal Notes arrow_drop_up

Improved By : Mithun Kumar



Article Tags :
Practice Tags :


Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.