py-cython-5-evalcount.py

cpdef int evalcount(int range_from, int range_til):
  """ Returns the number of evaluations that need to be performed when finding prime numbers in the given range range"""
  cdef int evalcount = 0
  cdef int num
  cdef int candidate_prime
  for num in range(range_from, range_til + 1):
    if (num > 1):
      for divnum in range(2, num):
        evalcount += 1
        if ((num % divnum) == 0):
          break
  return evalcount