bjoernager/rust
bjoernager/rust
1
Fork 0
Code Activity

auto merge of #17888 : gmfawcett/rust/patch-1, r=alexcrichton

Browse source 
The Sieve algorithm only requires checking all elements up to and including the square root of the maximum prime you're looking for. After that, the remaining elements are guaranteed to be prime.
This commit is contained in:
bors 2014-10-13 23:27:46 +00:00
commit 1c3ddd2971
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/libcollections/bitv.rs
View file

@ -33,7 +33,7 @@
//! bv.set(0, false);
//! bv.set(1, false);
//!
//! for i in range(2, max_prime) {
//! for i in iter::range_inclusive(2, (max_prime as f64).sqrt() as uint) {
//! // if i is a prime
//! if bv[i] {
//! // Mark all multiples of i as non-prime (any multiples below i * i