prime_finder_rust
| Crates.io | prime_finder_rust |
| lib.rs | prime_finder_rust |
| version | 0.1.0 |
| created_at | 2024-12-30 09:50:56.075405+00 |
| updated_at | 2024-12-30 09:50:56.075405+00 |
| description | A prime finder made in Rust (originally made in c++) |
| homepage | |
| repository | https://github.com/Hibernathan1212/prime-finder-rust.git |
| max_upload_size | |
| id | 1498950 |
| size | 10,279 |
Nathan Newton Thurber (Hibernathan1212)
documentation
README
Prime Finder in Rust
This project is a simple prime number finder written in Rust. It demonstrates basic Rust programming concepts and efficient algorithms for finding prime numbers.
Features
- Efficient prime number finding algorithm
- Command-line interface for user interaction
- Well-documented and easy to understand code
Requirements
- Rust (latest stable version)
- Cargo (Rust package manager)
Installation
- Clone the repository:
git clone https://github.com/yourusername/prime_finder_rust.git - Navigate to the project directory:
cd prime_finder_rust - Build the project:
cargo build --release
Usage
Run the program with the following command:
cargo run --release
You will be prompted to enter a number, and the program will output whether the number is prime or not.