Prime Visits problem

[vaishnavtannu (Vaishnavi Singh)]

Coding Blocks IDE

Why I am getting segmentation fault ?

[asaurabh_26 (logical coder)]

1. you need to call sieve function only at once

2. use long long int instead of int

3. also make bool array instead of int array as you only need to stroe 0 and 1

Modified Code

i hope this helps
if yes hit a like and don’t forgot to mark doubt as resolved
if you have more doubts regarding this feel free to ask

[vaishnavtannu (Vaishnavi Singh)]

What will be the time complexity of modified code ?

[asaurabh_26 (logical coder)]

it is O(n*log(log(n));

for explanation see this i have recently solve this doubt

How did thi O(n*log(logn)) came as the comolexity?

Understanding the n*log(log n) time complexity of Sieve of Eratosthenes If it is assumed that the time taken to mark a number as composite is constant, then the number of times the loop runs is equal to:[\frac{n}{2} + \frac{n}{3} + \frac{n}{5} + \frac{n}{7} + ...... p] On taking n common from the above equation, the above equation can be rewritten as: [n*(\frac{1}{2} + \frac{1}{3} + \frac{1}{5} + \frac{1}{7} + ...... p)] It can be proved as below with the help of Harmonic Progression …

i hope this helps
if yes hit a like and don’t forgot to mark doubt as resolved
if you have more doubts regarding this feel free to ask