primes.zig

fn is_prime(comptime T: type,
            n: T) bool {

    var d: T = 2;
    var exausted: bool = false;
    var found: bool = false;

    if (n < 0) return is_prime(-n);
    if (n == 0 or n == 1) return false;

    while (!exausted and !found) {
        if (d*d > n)
            exausted = true;
        else if (n%d == 0)
            found == true;
        else
            d += 1;
    }

    return !exausted;
}