Print Prime Numbers up to N

function isPrime(x) {
  if (x < 2) return false;
  for (let i = 2; i * i <= x; i++) {
    if (x % i === 0) return false;
  }
  return true;
}

const n = 20;
const primes = [];
for (let x = 2; x <= n; x++) {
  if (isPrime(x)) primes.push(x);
}
console.log(primes.join(" "));

import java.util.ArrayList;
import java.util.List;
import java.util.stream.Collectors;

public class Main {
    static boolean isPrime(int x) {
        if (x < 2) return false;
        for (int i = 2; (long) i * i <= x; i++) {
            if (x % i == 0) return false;
        }
        return true;
    }

    public static void main(String[] args) {
        int n = 20;
        List<Integer> primes = new ArrayList<>();
        for (int x = 2; x <= n; x++) {
            if (isPrime(x)) primes.add(x);
        }
        System.out.println(primes.stream().map(String::valueOf).collect(Collectors.joining(" ")));
    }
}

fun isPrime(x: Int): Boolean {
    if (x < 2) return false
    var i = 2
    while (i * i <= x) {
        if (x % i == 0) return false
        i++
    }
    return true
}

fun main() {
    val n = 20
    val primes = (2..n).filter { isPrime(it) }
    println(primes.joinToString(" "))
}

func isPrime(_ x: Int) -> Bool {
    if x < 2 { return false }
    var i = 2
    while i * i <= x {
        if x % i == 0 { return false }
        i += 1
    }
    return true
}

let n = 20
let primes = (2...n).filter { isPrime($0) }
print(primes.map(String.init).joined(separator: " "))

bool isPrime(int x) {
  if (x < 2) return false;
  for (var i = 2; i * i <= x; i++) {
    if (x % i == 0) return false;
  }
  return true;
}

void main() {
  int n = 20;
  final primes = <int>[];
  for (var x = 2; x <= n; x++) {
    if (isPrime(x)) primes.add(x);
  }
  print(primes.join(' '));
}

#include <iostream>
using namespace std;

bool isPrime(int x) {
    if (x < 2) return false;
    for (int i = 2; (long long) i * i <= x; i++) {
        if (x % i == 0) return false;
    }
    return true;
}

int main() {
    int n = 20;
    bool first = true;
    for (int x = 2; x <= n; x++) {
        if (isPrime(x)) {
            if (!first) cout << " ";
            cout << x;
            first = false;
        }
    }
    cout << endl;
    return 0;
}

#include <stdio.h>

int isPrime(int x) {
    if (x < 2) return 0;
    for (int i = 2; (long long) i * i <= x; i++) {
        if (x % i == 0) return 0;
    }
    return 1;
}

int main() {
    int n = 20, first = 1;
    for (int x = 2; x <= n; x++) {
        if (isPrime(x)) {
            if (!first) printf(" ");
            printf("%d", x);
            first = 0;
        }
    }
    printf("\n");
    return 0;
}