Description: procedures for the analysis of algorithms a classic problem, through this procedure, use dynamic programming algorithm to find a website of the longest sequence of ascending sequences of the algorithm and achieving the minimum cost
To Search:
- [RaceProject] - This is a classic analysis of the algori
- [MatrixChain_cversion] - This is the procedure used for algorithm
- [liushuizuoye] - This is based on the VC a simple routine
- [LCS] - Realize incremental solving integer sequ
- [-p2] - The longest common sub-sequence (LCS), t
File list (Check if you may need any files):
Download