Please explain line by line, what the code below is doing. It\'s supposed to det

Question

 Please explain line by line, what the code below is doing.  It's supposed to detect prime numbers using sieve of eratosthenes alg.  Output = [2 , 3, 5, 7]   # Sieve of Eratosthenes:   def all_prime_below_sieve (N):      # initialize a list of numbers     L = []     for i in range(N):         L.append(i)      # 0, 1 are not prime     L[0] = 0     L[1] = 0      # start sieving     i = 0     while (i < N):         if (L[i] != 0):             p = L[i]             k = i + p             while (k < N):                 L[k] = 0                 k = k + p          i = i + 1               # clean the list     L2 = []     for i in range(N):         if (L[i] != 0):             L2.append(L[i])              return L2      print(all_prime_below_sieve (10)) 

Explanation / Answer

# Sieve of Eratosthenes: #It prints all the prime numbers less than N def all_prime_below_sieve(N): # initialize a list of numbers with numbers from 0 to N L = [] for i in range(N): L.append(i) # 0, 1 are not prime L[0] = 0 L[1] = 0 # start sieving i = 0 #Running loop from 0 to N #This loop sets the value of list L at an index i to 1 means i is a prime number while (i

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---