Quick Sort Algorithm

A simple, generic implementation of the quick sort algorithm in Rust.

Usage

1. Add as a Dependency

Add the following to your Cargo.toml:

[dependencies]
quick_sort_yq = "0.1.5"

Replace the version with the latest published version if needed.

2. Import and Use

use quick_sort_yq::quick_sort;

fn main() {
    let mut arr = [3, 6, 8, 10, 1, 2, 1, 80];
    println!("Before: {:?}", arr);
    quick_sort(&mut arr);
    println!("After:  {:?}", arr);
}

Features

• Generic: Works with any type that implements Ord.
• No dependencies.

License

MIT