mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-24 05:21:09 +00:00
Code Issues Packages Projects Releases Wiki Activity
869 Commits 8 Branches 0 Tags 418 MiB
dab312e0e7
Commit Graph

5 Commits

Author SHA1 Message Date
cclauss
4e06949072 Modernize Python 2 code to get ready for Python 3 2017-11-25 10:23:50 +01:00
Mehdi ALAOUI
08cbd113a4 Code optimized and complexity decreased 2017-04-10 13:49:01 +01:00
Mehdi ALAOUI
e01cf425bd Comments reviewed 2017-04-07 03:27:15 +01:00
Mehdi ALAOUI
628f184af5 The program returns now the longest increasing subsequence instead of returning only the length. Code optimized and well commented 2017-04-07 03:19:02 +01:00
dhruvsaini
436edf3a88 Create longest_increasing_subsequence.py 
The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order. For example, the length of LIS for {10, 22, 9, 33, 21, 50, 41, 60, 80} is 6
 2017-01-03 16:54:38 +05:30