Description: The basis of algorithm analysis- Fibonacci sequence divide and conquer the problem of the numerical problems- the nearest point on the issue by governing law in the application of combinatorial problems- 8 coins become conquer the problem of scheduling problems in the- heap Scheduling
To Search:
File list (Check if you may need any files):
算法设计与分析基础\算法\Project1.bpr
..................\....\Project1.cpp
..................\....\Project1.exe
..................\....\Project1.obj
..................\....\Project1.res
..................\....\Project1.tds
..................\....\Unit1.cpp
..................\....\Unit1.ddp
..................\....\Unit1.dfm
..................\....\Unit1.h
..................\....\Unit1.obj
..................\....\Unit2.cpp
..................\....\Unit2.ddp
..................\....\Unit2.dfm
..................\....\Unit2.h
..................\....\Unit2.obj
..................\....\Unit3.cpp
..................\....\Unit3.ddp
..................\....\Unit3.dfm
..................\....\Unit3.h
..................\....\Unit3.obj
..................\....\Unit4.cpp
..................\....\Unit4.ddp
..................\....\Unit4.dfm
..................\....\Unit4.h
..................\....\Unit4.obj
..................\....\Unit5.cpp
..................\....\Unit5.ddp
..................\....\Unit5.dfm
..................\....\Unit5.h
..................\....\Unit5.obj
..................\算法
算法设计与分析基础
Download