mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-18 16:27:02 +00:00
Code Issues Packages Projects Releases Wiki Activity

Comments reviewed

Browse Source
This commit is contained in:
Mehdi ALAOUI 2017-04-07 03:27:15 +01:00
parent 628f184af5
commit e01cf425bd
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
dynamic_programming/longest_increasing_subsequence.py
View File

@ -16,8 +16,8 @@ def longestSub(ARRAY): #This function is recursive
#Else
PIVOT=ARRAY[0]
LONGEST_SUB=[] #This array will contains the longest increasing sub array
for i in range(1,ARRAY_LENGTH):
if (ARRAY[i] < PIVOT): #For each element from the array (except the pivot), if the element is smaller than the pivot, it won't figure on the sub array that contains the pivot
for i in range(1,ARRAY_LENGTH): #For each element from the array (except the pivot),
if (ARRAY[i] < PIVOT): #if the element is smaller than the pivot, it won't figure on the sub array that contains the pivot
TEMPORARY_ARRAY = [ element for element in ARRAY[i:] if element >= ARRAY[i] ] #But it cas figure in an increasing sub array starting from this element
TEMPORARY_ARRAY = longestSub(TEMPORARY_ARRAY) #We calculate the longest sub array that starts from this element
if ( len(TEMPORARY_ARRAY) > len(LONGEST_SUB) ): #And we save the longest sub array that begins from an element smaller than the pivot (in LONGEST_SUB)