quick_sort_yq 0.1.5

A sample quick sort algorithm
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38

# 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`:

```toml
[dependencies]
quick_sort_yq = "0.1.5"
```

Replace the version with the latest published version if needed.

### 2. Import and Use

```rust
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