leetcode-Count Primes

Description:

Count the number of prime numbers less than a non-negative number, n

int countPrimes(int n) {
    int i,j;
    bool *primer = malloc(sizeof(bool)*n);
    for(i=0;i<n;i++)
    {
        primer[i]=true;
    }
    primer[0] = false;
    primer[1] = false;
    int limit = sqrt(n);
    
    for(i = 2; i <=limit;i++)
    {
        for(j = i*i;j<n;j+=i)
        {
            primer[j]=false;
        }
    }
    int result = 0;
    for(i = 0;i<n;i++)
    {
        if(primer[i])
          result++;
    }
    return result;
    
}