implementation of prime finder, modular square root finder and squaring operations in RUST
given a number n, find the biggest prime, which is smaller than n
given a number, find it's square roots, in given modulo
given a number, compute it's square, in given modulo
- Download the repo
- move to this repo's root directory in your favourite terminal
- run the command
cargo build
, check if it builds successfully - run the command `cargo run
P.S. you have to have rust and cargo installed in your system
- Download the repo
- move to this repo's root directory in your favourite terminal
- run the command
cargo doc --open
- This command will open a browser, and in there, all the documentation will be provided with a user-friendly interface
- Download the repo
- move to this repo's root directory in your favourite terminal
- run the command
cargo test
- you can see the results in the terminal
- Download the repo
- move to this repo's root directory in your favourite terminal
- run the command
cargo bench
- Go to this path inside this repo
target/criterion/report
- open the
index.html
in your favourite browser - you can see the benchmark results in your browser, with a nice user-friendly interface