Algorithm experiment: 1 divided numerical problems in the application- the nearest point to question 2 by governance problems in the application portfolio- 8 coins 3 Variable governance issues in order of application- HEAPSORT 4 dynamic programming problems in the application map- the whole question of the source of the shortest path

DivConquer
..........\Debug
..........\decConquer.h
..........\Decfunction.cpp
..........\divCon.h
..........\DivConquer.dsp
..........\DivConquer.dsw
..........\DivConquer.ncb
..........\DivConquer.opt
..........\DivConquer.plg
..........\Divfuntion.cpp
..........\heap.h
..........\Heapfunction.cpp
..........\main.cpp
..........\pathfunction.cpp
..........\shortestPath.h
..........\弧.txt
..........\弧1.txt
..........\顶点.txt
..........\顶点1.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．