Given a decimal number as input, we need to write a program to convert the given decimal number into equivalent binary number.
Input : 7 Output :111 Input :10 Output :1010
We have discussed one iterative solution in below post.
Program for Decimal to Binary Conversion
Below is Recursive solution
findBinary(decimal) if (decimal == 0) binary = 0 else binary = decimal % 2 + 10 * (findBinary(decimal / 2)
Step by step process for better understanding of how the algorithm works
Let decimal number be 10.
Step 1-> 10 % 2 which is equal-too 0 + 10 * ( 10/2 ) % 2
Step 2-> 5 % 2 which is equal-too 1 + 10 * ( 5 / 2) % 2
Step 3-> 2 % 2 which is equal-too 0 + 10 * ( 2 / 2 ) % 2
Step 4-> 1 % 2 which is equal-too 1 + 10 * ( 1 / 2 ) % 2
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
- Decimal to Binary using recursion and without using power operator
- Python program to convert decimal to binary number
- Recursive Program for Binary to Decimal
- Program for Decimal to Binary Conversion
- Program for Binary To Decimal Conversion
- Binary to Gray code using recursion
- Binary to decimal and vice-versa in python
- Decimal to binary conversion without using arithmetic operators
- Decimal representation of given binary string is divisible by 10 or not
- Decimal representation of given binary string is divisible by 20 or not
- Find Maximum Level Sum in Binary Tree using Recursion
- Find the node with maximum value in a Binary Search Tree using recursion
- Leaf nodes from Preorder of a Binary Search Tree (Using Recursion)
- Maximum decimal equivalent possible among all connected components of a Binary Valued Graph
- Program to Convert BCD number into Decimal number
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.