lisa 0.1.0

lisa - longest increasing subsequence algorithm[O(nlogn)]
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20

## What it does
Finds the longest increasing subsequence (lis).

## Features
1. Time complexity `O(nlogn)`
2. Space complexity `O(n)`
3. Supports multiple types

## Example

```rs
use lisa::interface::find_lis;

fn main() {
	let slice = [3, 10, 2, 1, 20];
	let lis = find_lis(&slice);

	println!("{:?}", lis); // [3, 10, 20]
 }
```