diff options
| author | lloyd <[email protected]> | 2006-07-16 08:31:59 +0000 |
|---|---|---|
| committer | lloyd <[email protected]> | 2006-07-16 08:31:59 +0000 |
| commit | ba8b8d81c085ceb22d735e3a429f5234855b8fe3 (patch) | |
| tree | 0b92759ac9c064be0c011f21fa1f611921fdec62 | |
| parent | 7675ae670776907c2f7268833e2576fb5fa36391 (diff) | |
Remove whitespace, add a slightly informative comment, etc
| -rw-r--r-- | doc/examples/factor.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/examples/factor.cpp b/doc/examples/factor.cpp index 1855c8ad2..24335ceb4 100644 --- a/doc/examples/factor.cpp +++ b/doc/examples/factor.cpp @@ -7,8 +7,10 @@ #include <botan/numthry.h> using namespace Botan; +#include <algorithm> #include <iostream> +// Pollard's Rho algorithm, as described in the MIT algorithms book BigInt rho(const BigInt& n) { BigInt x = random_integer(0, n-1); @@ -97,8 +99,6 @@ int main(int argc, char* argv[]) for(u32bit j = 0; j != factors.size(); j++) std::cout << factors[j] << " "; std::cout << "\n"; - - } catch(std::exception& e) { |