Algorithm Complexity
Time complexity in the random access machine model is operations, a direct consequence of the fact that the prime harmonic series asymptotically approaches .
The bit complexity of the algorithm is bit operations with a memory requirement of .
The segmented version of the sieve of Eratosthenes, with basic optimizations, uses operations and bits of memory.
Read more about this topic: Sieve Of Eratosthenes
Famous quotes containing the word complexity:
“In times like ours, where the growing complexity of life leaves us barely the time to read the newspapers, where the map of Europe has endured profound rearrangements and is perhaps on the brink of enduring yet others, where so many threatening and new problems appear everywhere, you will admit it may be demanded of a writer that he be more than a fine wit who makes us forget in idle and byzantine discussions on the merits of pure form ...”
—Marcel Proust (1871–1922)