357dbd4ada738ed9d4b814eeec99bcc833e94aff,dynamic_programming/longest_increasing_subsequence_o(nlogn).py,,,#,39
Before Change
if __name__ == "__main__":
v = [2, 5, 3, 7, 11, 8, 10, 13, 6]
print(LongestIncreasingSubsequenceLength(v))
After Change
if __name__ == "__main__":
import doctest
doctest.testmod()
In pattern: SUPERPATTERN
Frequency: 3
Non-data size: 4
Instances
Project Name: TheAlgorithms/Python
Commit Name: 357dbd4ada738ed9d4b814eeec99bcc833e94aff
Time: 2019-10-30
Author: johnlaw.po@gmail.com
File Name: dynamic_programming/longest_increasing_subsequence_o(nlogn).py
Class Name:
Method Name:
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: 53c2a24587aaf864ec40d2445d071a8274926c37
Time: 2020-09-25
Author: abdujabbar.mirkhalikov@gmail.com
File Name: backtracking/minimax.py
Class Name:
Method Name: