string-hash.c
unsigned long int next_prime(unsigned long int n) {
    if (n <= 1)
        return 2;
    unsigned long int prime = n;
    int found = 0;
    while (!found)
    {
        prime++;
        if (is_prime(prime))
        {
            found = 1;
        }
    }
    return prime;
}
//To look for the immediate next prime number.
To look for the immediate next prime number.
To look for the immediate next prime number .
unsigned long int next_prime(unsigned long int n) {
    if (n <= 1)
        return 2;
    unsigned long int prime = n;
    int found = 0;
    while (!found)
    {
        prime++;
        if (is_prime(prime))
        {
            found = 1;
        }
    }
    return prime;
}
unsigned long int next_prime ( unsigned long int n ) { if ( n <= 1 ) return 2 ; unsigned long int prime = n ; int found = 0 ; while ( ! found ) { prime ++ ; if ( is_prime ( prime ) ) { found = 1 ; } } return prime ; }
To look for the immediate next prime number.
To look for the immediate next prime number .