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

This version
History Node

0.2

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Filename, size & hash SHA256 hash help File type Python version Upload date
L_I_S.tar.gz (2.0 kB) Copy SHA256 hash SHA256 Source None

Supported by

Elastic Elastic Search Pingdom Pingdom Monitoring Google Google BigQuery Sentry Sentry Error logging AWS AWS Cloud computing DataDog DataDog Monitoring Fastly Fastly CDN SignalFx SignalFx Supporter DigiCert DigiCert EV certificate StatusPage StatusPage Status page