between-us 1.0.0

Finds two most distant smaller and bigger numbers.
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

Far across the distance,
And spaces, between us 🎵

### Functionality
Finds the maximmum **`right - left`**, such that **`list[right] > list[left]`**.

**Time Complexity :** **`O(n)`** (2 traversals)

**Space Complexity :** **`O(n)`** (1 extra list)

### How to use
The **`find_distance`** function takes a ref to an array or a vector as a paramaeter, and finds the maximum distance of two such elements.

It returns an `Option<usize>` type as a result, because two such numbers that satisfy the condition might not exist. In that case, it returns `None`.

**Quick Start:**
```rust
use between_us::interface::find_distance;

fn main() {
	let list = [5, 3, 7, 1, 6, 8, 4];

	let result = find_distance(&list);

	println!("{:?}", result);

	// Output: Some(5)
}
```