// numPrimes(n) returns the number of values in // list [1,...,n] that are prime. int numPrimes(int n) { if(n < 2) { return 0; } else { int m = numPrimes(n-1); if(isPrime(n)) { return m; } else { return m + 1; } } }