longest increasing subsequences
Project description
——-LIS -——- This module contains the main function “LIS” plus 2 ad hoc functions used by LIS namely “nest” and “gmls”.
Given a list of unique numbers, the LIS function outputs all LIS from list i.e. the longest increasing subsequences having the maximum length among all results. To implement, type “from L_I_S import LIS” then try “LIS([2,5,1,3,4])”. Note that the external module list_operations is required “from list_operations import unnest”.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
L_I_S.tar.gz
(2.0 kB
view details)
File details
Details for the file L_I_S.tar.gz.
File metadata
- Download URL: L_I_S.tar.gz
- Upload date:
- Size: 2.0 kB
- Tags: Source
- Uploaded using Trusted Publishing? No
File hashes
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 |
356912ee0c4cb66d0335802d131b90a3590618d67a2dc8991d209082a89cd4a9
|
|
| MD5 |
2d4c75ff9a9a12fa47a3113336d3066b
|
|
| BLAKE2b-256 |
ce688f48bd79befcfa8bc20878d91493ef98bb589a0f1bc5a84ee964d28972cd
|
