Skip to main content

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”.

Project details


Release history Release notifications | RSS feed

This version

0.2

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 hashes)

Uploaded Source

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page