Decimal a binario

Version recursiva

1 2 3 4 5 6 7 8 9 10 11 12 13 14

#include <iostream> using namespace std; string binario(int x) { string s = (x > 1) ? binario(x / 2) : ""; s += to_string(x % 2); return s; } int main() { for(int i = 0; i < 256; i++) { cout << i << " " << binario(i) << endl; } }

Other entries:

• isPrime: Naive version 
• isPrime, Optimization 1: Iterate only until the square root of the number
• isPrime, Optimization 2: Only divide by odd numbers, until the square root of the number
• isPrime, Optimization 3: Skip the divisors that are multiple of 2 or 3
• Keep the previosly generated primes and use them to test the following numbers.
• isPrime, Recursive.