Convert String into Binary Sequence
Last Updated :
04 Aug, 2022
Improve
Given a string of character the task is to convert each character of a string into the equivalent binary number.
Examples :
Input : GFG Output : 1000111 1000110 1000111 Input : geeks Output : 1100111 1100101 1100101 1101011 1110011
The idea is to first calculate the length of the string as n and then run a loop n times. In each iteration store ASCII value of character in variable val and then convert it into binary number and store result in array finally print the array in reverse order.
Implementation:
- C++
- Java
- Python3
- C#
- PHP
- Javascript
C++
// C++ program to convert// string into binary string#include <bits/stdc++.h>using namespace std;// utility functionvoid strToBinary(string s){ int n = s.length(); for (int i = 0; i <= n; i++) { // convert each char to // ASCII value int val = int(s[i]); // Convert ASCII value to binary string bin = ""; while (val > 0) { (val % 2)? bin.push_back('1') : bin.push_back('0'); val /= 2; } reverse(bin.begin(), bin.end()); cout << bin << " "; }}// driver codeint main(){ string s = "geeks"; strToBinary(s); return 0;} |
Java
Python3
C#
PHP
Javascript
Output
1100111 1100101 1100101 1101011 1110011
Time complexity : O(n)
Auxiliary Space : O(n)
