Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Write a Python function that when executed, asks the user to enter an integer number, then the function gives out the number of prime numbers that are smaller than the input integer number. Here is the answer to this question using only the knowledge of recursive functions and if-blocks, def isPrime(n):        isPrime =True        def is_divisible(n,divisor):          if n<(divisor-1)*divisor: return False          if n%divisor==0: return True  else:       divisor +=1  return is_divisible(n,divisor)  if n==2:     isPrime =True    elif is_divisible(n,divisor=2):          isPrime =False      return isPrime   def getNumPrimes(n):      if n <=2:        return0     else:      return isPrime(n-1)+ getNumPrimes(n-1) getNumPrimes(13) 5 (A) Now rewrite getNumPrimes(n) and the other functions in the above code using for-loop this time. Name the new functions get_prime_for(n) and isPrime_for(n), with for in the names indicating that the functions now use for-loops.

Write a Python function that when executed, asks the user to enter an integer number, then the function gives out the number of prime numbers that are smaller than the input integer number. Here is the answer to this question using only the knowledge of recursive functions and if-blocks, def isPrime(n):        isPrime =True        def is_divisible(n,divisor):          if n<(divisor-1)*divisor: return False          if n%divisor==0: return True  else:       divisor +=1  return is_divisible(n,divisor)  if n==2:     isPrime =True    elif is_divisible(n,divisor=2):          isPrime =False      return isPrime   def getNumPrimes(n):      if n <=2:        return0     else:      return isPrime(n-1)+ getNumPrimes(n-1) getNumPrimes(13) 5 (A) Now rewrite getNumPrimes(n) and the other functions in the above code using for-loop this time. Name the new functions get_prime_for(n) and isPrime_for(n), with for in the names indicating that the functions now use for-loops.

icon
Related questions
Question

Write a Python function that when executed, asks the user to enter an integer number, then the function gives out the number of prime numbers that are smaller than the input integer number. Here is the answer to this question using only the knowledge of recursive functions and if-blocks,

def isPrime(n):
       isPrime =True
       def is_divisible(n,divisor):
         if n<(divisor-1)*divisor: return False
         if n%divisor==0: return True
 else:
      divisor +=1
 return is_divisible(n,divisor)
 if n==2:
    isPrime =True
   elif is_divisible(n,divisor=2):
         isPrime =False
     return isPrime
 
def getNumPrimes(n):
     if n <=2:
       return0
    else:
     return isPrime(n-1)+ getNumPrimes(n-1)
getNumPrimes(13)

5

(A) Now rewrite getNumPrimes(n) and the other functions in the above code using for-loop this time. Name the new functions get_prime_for(n) and isPrime_for(n), with for in the names indicating that the functions now use for-loops.

(B) Now compare the performance of the two functions getNumPrimes(n=500) and getNumPrimes_for(n=500) using Jupyter’s or IPython’s %timeit magic function. Which one is faster?

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Computational Systems
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.