a9d5378ce2251b43d4f2541283ff6f1a558a3bfa,dynamic_programming/longest_increasing_subsequence.py,,,#,44
Before Change
// Some examples
print(longestSub([4, 8, 7, 5, 1, 12, 2, 3, 9]))
print(longestSub([9, 8, 7, 6, 5, 7]))
After Change
return longest_subseq
if __name__ == "__main__":
import doctest
doctest.testmod()
In pattern: SUPERPATTERN
Frequency: 4
Non-data size: 6
Instances
Project Name: TheAlgorithms/Python
Commit Name: a9d5378ce2251b43d4f2541283ff6f1a558a3bfa
Time: 2019-11-04
Author: johnlaw.po@gmail.com
File Name: dynamic_programming/longest_increasing_subsequence.py
Class Name:
Method Name:
Project Name: TheAlgorithms/Python
Commit Name: ddb094919b8af4b1268e118fa3e33868c30f4386
Time: 2019-10-17
Author: jigsgandhi97@gmail.com
File Name: dynamic_programming/fractional_knapsack.py
Class Name:
Method Name:
Project Name: TheAlgorithms/Python
Commit Name: 814750e637ff3a28442808dc10b2c23170abc85b
Time: 2019-10-31
Author: shellhub.me@gmail.com
File Name: maths/factorial_recursive.py
Class Name:
Method Name:
Project Name: TheAlgorithms/Python
Commit Name: e67887989232bb64533995cc1044e13d739b02ef
Time: 2019-10-11
Author: jigsgandhi97@gmail.com
File Name: dynamic_programming/sum_of_subset.py
Class Name:
Method Name: