You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
It should be possible, yes. It could be a new iterator type, or we could try making SievePrimes doubled-ended, although that would require more complicated state.
Hi, I have the usecase where I need to iterate primes of a sieve in descending order starting from some upper bound.
This example prints all primes below 100 in descending order
Is a function like this possible?
The text was updated successfully, but these errors were encountered: