算法实验源码

上传者: baosuning | 上传时间: 2023-01-04 16:59:57 | 文件大小: 577KB | 文件类型: RAR
包含的算法: 1、棋盘覆盖(控制台和MFC版) 2、二分搜索 3、分治法求线性序列中第k 小的数 4、找a[i]=i的下标i 5、求最长公共子序列 6、最大字段和问题 7、0-1背包问题(动态规划实现) 8、多机调度算法实现代码 9、汽车加油问题 10、贪心算法实现最小生成树——prim算法实现 11、0-1背包问题(回溯法实现) 12、符号三角形问题代码 13、跳马问题代码 还有实验截图!

文件下载

资源详情

[{"title":"( 58 个子文件 577KB ) 算法实验源码","children":[{"title":"大三时算法课的实验源代码","children":[{"title":"大三时算法课的实验源代码","children":[{"title":"算法实验截图","children":[{"title":"4_3.jpg <span style='color:#111;'> 11.33KB </span>","children":null,"spread":false},{"title":"4_1_2.jpg <span style='color:#111;'> 8.94KB </span>","children":null,"spread":false},{"title":"2_1.jpg <span style='color:#111;'> 11.56KB </span>","children":null,"spread":false},{"title":"1_4.jpg <span style='color:#111;'> 11.70KB </span>","children":null,"spread":false},{"title":"2_4.jpg <span style='color:#111;'> 26.33KB </span>","children":null,"spread":false},{"title":"1_3_2.jpg <span style='color:#111;'> 20.92KB </span>","children":null,"spread":false},{"title":"1_2.jpg <span style='color:#111;'> 23.93KB </span>","children":null,"spread":false},{"title":"2_2.jpg <span style='color:#111;'> 8.98KB </span>","children":null,"spread":false},{"title":"1_5_3.jpg <span style='color:#111;'> 39.88KB </span>","children":null,"spread":false},{"title":"1_3_1.jpg <span style='color:#111;'> 16.39KB </span>","children":null,"spread":false},{"title":"2_6.jpg <span style='color:#111;'> 16.11KB </span>","children":null,"spread":false},{"title":"4_1.jpg <span style='color:#111;'> 9.42KB </span>","children":null,"spread":false},{"title":"4_2.jpg <span style='color:#111;'> 13.23KB </span>","children":null,"spread":false},{"title":"1_5_2.jpg <span style='color:#111;'> 60.10KB </span>","children":null,"spread":false},{"title":"2_3.jpg <span style='color:#111;'> 18.92KB </span>","children":null,"spread":false},{"title":"2_5.jpg <span style='color:#111;'> 41.43KB </span>","children":null,"spread":false},{"title":"1_5.jpg <span style='color:#111;'> 43.43KB </span>","children":null,"spread":false},{"title":"1_1.jpg <span style='color:#111;'> 19.14KB </span>","children":null,"spread":false},{"title":"Thumbs.db <span style='color:#111;'> 39.00KB </span>","children":null,"spread":false}],"spread":false},{"title":"实验二","children":[{"title":"提高题","children":[{"title":"0-1背包问题(动态规划实现).txt <span style='color:#111;'> 1.97KB </span>","children":null,"spread":false}],"spread":true},{"title":"基础题","children":[{"title":"最大字段和问题.txt <span style='color:#111;'> 527B </span>","children":null,"spread":false},{"title":"最长公共子序列.txt <span style='color:#111;'> 1.41KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"实验一","children":[{"title":"提高题","children":[{"title":"二分搜索算法.txt <span style='color:#111;'> 1.82KB </span>","children":null,"spread":false},{"title":"用分治法求线性序列中第k 小的数.txt <span style='color:#111;'> 1.32KB </span>","children":null,"spread":false},{"title":"找a[i]=i的下标i.txt <span style='color:#111;'> 632B </span>","children":null,"spread":false}],"spread":true},{"title":"基础题","children":[{"title":"动态二维数组的创建.txt <span style='color:#111;'> 3.21KB </span>","children":null,"spread":false},{"title":"棋盘覆盖.txt <span style='color:#111;'> 2.03KB </span>","children":null,"spread":false},{"title":"chessBoard","children":[{"title":"ReadMe.txt <span style='color:#111;'> 3.57KB </span>","children":null,"spread":false},{"title":"StdAfx.h <span style='color:#111;'> 1.03KB </span>","children":null,"spread":false},{"title":"chessBoard.cpp <span style='color:#111;'> 2.07KB </span>","children":null,"spread":false},{"title":"res","children":[{"title":"chessBoard.rc2 <span style='color:#111;'> 402B </span>","children":null,"spread":false},{"title":"chessBoard.ico <span style='color:#111;'> 1.05KB </span>","children":null,"spread":false}],"spread":true},{"title":"chessBoard.plg <span style='color:#111;'> 742B </span>","children":null,"spread":false},{"title":"chessBoard.ncb <span style='color:#111;'> 73.00KB </span>","children":null,"spread":false},{"title":"chessBoard.h <span style='color:#111;'> 1.34KB </span>","children":null,"spread":false},{"title":"chessBoard.opt <span style='color:#111;'> 48.50KB </span>","children":null,"spread":false},{"title":"chessBoard.dsw <span style='color:#111;'> 528B </span>","children":null,"spread":false},{"title":"chessBoard.clw <span style='color:#111;'> 1.35KB </span>","children":null,"spread":false},{"title":"Debug","children":[{"title":"vc60.pdb <span style='color:#111;'> 356.00KB </span>","children":null,"spread":false},{"title":"chessBoard.obj <span style='color:#111;'> 13.03KB </span>","children":null,"spread":false},{"title":"chessBoard.pdb <span style='color:#111;'> 353.00KB </span>","children":null,"spread":false},{"title":"chessBoardDlg.obj <span style='color:#111;'> 33.75KB </span>","children":null,"spread":false},{"title":"chessBoard.res <span style='color:#111;'> 2.85KB </span>","children":null,"spread":false},{"title":"chessBoard.exe <span style='color:#111;'> 112.09KB </span>","children":null,"spread":false},{"title":"StdAfx.obj <span style='color:#111;'> 103.31KB </span>","children":null,"spread":false}],"spread":false},{"title":"chessBoardDlg.h <span style='color:#111;'> 1.69KB </span>","children":null,"spread":false},{"title":"resource.h <span style='color:#111;'> 918B </span>","children":null,"spread":false},{"title":"chessBoard.rc <span style='color:#111;'> 5.64KB </span>","children":null,"spread":false},{"title":"chessBoardDlg.cpp <span style='color:#111;'> 7.60KB </span>","children":null,"spread":false},{"title":"chessBoard.dsp <span style='color:#111;'> 4.13KB </span>","children":null,"spread":false},{"title":"StdAfx.cpp <span style='color:#111;'> 212B </span>","children":null,"spread":false},{"title":"chessBoard.aps <span style='color:#111;'> 21.00KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}],"spread":true},{"title":"实验三","children":[{"title":"提高题","children":[{"title":"最小生成树.txt <span style='color:#111;'> 1.71KB </span>","children":null,"spread":false},{"title":"汽车加油问题.txt <span style='color:#111;'> 1.21KB </span>","children":null,"spread":false}],"spread":true},{"title":"基础题","children":[{"title":"多机调度算法实现代码.txt <span style='color:#111;'> 2.70KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"实验四","children":[{"title":"提高题","children":[{"title":"跳马问题代码.txt <span style='color:#111;'> 2.13KB </span>","children":null,"spread":false}],"spread":true},{"title":"基础题","children":[{"title":"符号三角形问题代码.txt <span style='color:#111;'> 1.08KB </span>","children":null,"spread":false},{"title":"0-1背包问题(回溯法实现).txt <span style='color:#111;'> 2.76KB </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}],"spread":true}],"spread":true}]

评论信息

免责申明

【只为小站】的资源来自网友分享,仅供学习研究,请务必在下载后24小时内给予删除,不得用于其他任何用途,否则后果自负。基于互联网的特殊性,【只为小站】 无法对用户传输的作品、信息、内容的权属或合法性、合规性、真实性、科学性、完整权、有效性等进行实质审查;无论 【只为小站】 经营者是否已进行审查,用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。
本站所有资源不代表本站的观点或立场,基于网友分享,根据中国法律《信息网络传播权保护条例》第二十二条之规定,若资源存在侵权或相关问题请联系本站客服人员,zhiweidada#qq.com,请把#换成@,本站将给予最大的支持与配合,做到及时反馈和处理。关于更多版权及免责申明参见 版权及免责申明