Logo

Programming-Idioms

  • Go
  • C++
  • Haskell

Idiom #76 Binary digits from an integer

Create the string s of integer x written in base 2.

E.g. 13 -> "1101"

import Data.List
foldl (\acc -> (++ acc) . show) "" . unfoldr (\n -> if x == 0 then Nothing else Just (x `mod` 2, x `div` 2))

Sure, it will produce the empty string for 0 but it's a catamorphism composed with an anamorphism... I mean how much more Haskell-y do you get? There's even some currying and partial application in there!
import Numeric (showIntAtBase)
import Data.Char (intToDigit)
s x = showIntAtBase 2 intToDigit x ""
import "fmt"
import "math/big"
s := fmt.Sprintf("%b", x)

x has the type *big.Int.

This works because *big.Int implements the fmt.Formatter interface.
import "strconv"
s := strconv.FormatInt(x, 2)

Here x has the type int64.

For very big numbers, prefer the type *big.Int.
#include <charconv>
std::string ToBinary(int x) {
  std::array<char, 64> buf;
  auto[ptr, ec] = std::to_chars(buf.data(), buf.data() + buf.size(), x, 2);
  auto s = std::string(buf.data(), ptr);
  return s;
}

The 2 at the end of to_chars is for base 2
#include <bitset>
std::bitset<sizeof(x)*8> y(x);
auto s = y.to_string();
(:require [clojure.pprint])
(defn s
  [x]
  (pprint/cl-format nil "~b" x))

Call s and pass an integer x to it and it will return your integer in base 2.
New implementation...
< > ⌨
deleplace 
foldl (\acc -> (++ acc) . show) "" . unfoldr (\n -> if x == 0 then Nothing else Just (x `mod` 2, x `div` 2))
s x = showIntAtBase 2 intToDigit x ""
s := fmt.Sprintf("%b", x)
s := strconv.FormatInt(x, 2)
std::string ToBinary(int x) {
  std::array<char, 64> buf;
  auto[ptr, ec] = std::to_chars(buf.data(), buf.data() + buf.size(), x, 2);
  auto s = std::string(buf.data(), ptr);
  return s;
}

std::bitset<sizeof(x)*8> y(x);
auto s = y.to_string();
(defn s
  [x]
  (pprint/cl-format nil "~b" x))
String s = Convert.ToString(x,2);
String s = Convert.ToString(x,2).PadLeft(16, '0');
auto s = to!string(x,2);
var s = x.toRadixString(2);
s = Integer.to_string(x, 2)
Integer.digits(x, 2) |> Enum.join("")
S = io_lib:format("~.2B~n", [X]).
write (unit=s,fmt='(B32)') x
write (unit=s,fmt='(B0)') x
let s = x.toString(2);
String s = Integer.toBinaryString(x);
(defparameter x 13)
(defvar s)
(setf s (format nil "~B" x))
local s = {}

while x > 0 do
    local tmp = math.fmod(x,2)
    s[#s+1] = tmp
    x=(x-tmp)/2
end

s=table.concat(s)
$s = sprintf("%b", $x);
var
  _x: Integer;
  _s: String;
begin
  _s := IntToBin(_x,8*SizeOf(Integer));
end.
var Iter,n:integer;
[...]
  S := '';
  for Iter := 0 to n do
    s:= Char(Ord('0')+(x shr Iter) and 1) + S;   
$s = sprintf "%b", $x;
s = format(x, 'b')
s = '{:b}'.format(x)
s = x.to_s(2)

let s = format!("{x:b}");
let s = format!("{:b}", x);
val s = x.toString(2)
(define (binary-representation x)
  (let loop ([N x]
             [s '()])
    (let ([NN (arithmetic-shift N -1)])
      (cond [(zero? N) (list->string s)]
            [(odd? N) (loop NN (cons #\1 s))]
            [else (loop NN (cons #\0 s))]))))