diff options
| author | Graham Fawcett <graham.fawcett@gmail.com> | 2014-10-09 10:02:07 -0400 |
|---|---|---|
| committer | Graham Fawcett <graham.fawcett@gmail.com> | 2014-10-09 10:02:07 -0400 |
| commit | 7cf1f55426570582224e0568c838a29c5f7db5ea (patch) | |
| tree | ffe8b5d2dbea41b61b21caf4e9726a8e35b730f3 | |
| parent | e6cfb56a5cee28b08ae9d2dcbb2552497ce922c1 (diff) | |
| download | rust-7cf1f55426570582224e0568c838a29c5f7db5ea.tar.gz rust-7cf1f55426570582224e0568c838a29c5f7db5ea.zip | |
In sieve example, end iteration sooner
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.
| -rw-r--r-- | src/libcollections/bitv.rs | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/src/libcollections/bitv.rs b/src/libcollections/bitv.rs index 9f26c098013..6da998b136f 100644 --- a/src/libcollections/bitv.rs +++ b/src/libcollections/bitv.rs @@ -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 |