lisa
| Crates.io | lisa |
| lib.rs | lisa |
| version | 0.2.0 |
| source | src |
| created_at | 2021-12-29 10:59:03.533093 |
| updated_at | 2021-12-30 00:40:18.332349 |
| description | lisa - longest increasing subsequence algorithm [ O( nlogn ) ] |
| homepage | |
| repository | https://github.com/LittleTasteOfHeaven/rusty-algos/tree/master/problems/lisa |
| max_upload_size | |
| id | 504768 |
| size | 4,892 |
Tausif (tausifcreates)
documentation
https://docs.rs/lisa
README
What it does
Finds the longest increasing subsequence (lis).
Features
- Time complexity
O(nlogn) - Space complexity
O(n) - Supports multiple types
Version Note : Update Readme and description
Example
use lisa::interface::find_lis;
fn main() {
let slice = [3, 10, 2, 1, 20];
let lis = find_lis(&slice);
println!("{:?}", lis); // [3, 10, 20]
}