lisa 0.2.0

lisa - longest increasing subsequence algorithm [ O( nlogn ) ]
Documentation
  • Coverage
  • 33.33%
    1 out of 3 items documented1 out of 1 items with examples
  • Size
  • Source code size: 4.57 kB This is the summed size of all the files inside the crates.io package for this release.
  • Documentation size: 1.07 MB This is the summed size of all files generated by rustdoc for all configured targets
  • Links
  • Repository
  • crates.io
  • Dependencies
    • —
  • Versions
  • Owners
  • inoshy tausifcreates

What it does

Finds the longest increasing subsequence (lis).

Features

  1. Time complexity O(nlogn)
  2. Space complexity O(n)
  3. 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]
 }