Open shwetankverma13 opened 4 years ago
using this algo one can find prime in NloglogN time which will only be calulated once.....prime checking will done in O(1) then... this will work fine upto numbers= 10^6
using this algo one can find prime in NloglogN time which will only be calulated once.....prime checking will done in O(1) then... this will work fine upto numbers= 10^6