File tree Expand file tree Collapse file tree 1 file changed +2
-3
lines changed Expand file tree Collapse file tree 1 file changed +2
-3
lines changed Original file line number Diff line number Diff line change 1- import  time 
21from  math  import  sqrt , ceil 
32
43
@@ -8,7 +7,7 @@ def segmented_sieve(range_from, range_to):
87    memory to find the prime numbers in a given range. 
98
109    Space complexity: O(l) 
11-     Time complexity: O(l log(logl)) 
10+     Time complexity: O(l *  log(logl)) 
1211
1312    l =  range_to - range_from 
1413    """ 
@@ -20,7 +19,7 @@ def segmented_sieve(range_from, range_to):
2019    # initialize a boolean list of size l, with True. 
2120    primes_range  =  [True  for  _  in  range (range_to  -  range_from  +  1 )]
2221
23-     # generate primes upto sqrt(range_to) using SieveOfEratosthenes . 
22+     # generate primes upto sqrt(range_to) using Sieve of Eratosthenes . 
2423    primes  =  sieve_eratosthenes (ceil (sqrt (range_to )))
2524
2625    # for every prime, all its multiples will not be prime 
    
 
   
 
     
   
   
          
     
  
    
     
 
    
      
     
 
     
    You can’t perform that action at this time.
  
 
    
  
     
    
      
        
     
 
       
      
     
   
 
    
    
  
 
  
 
     
    
0 commit comments