算法分析与设计实验 Java 实现

上传者: wanbingglass | 上传时间: 2022-11-24 15:24:20 | 文件大小: 409KB | 文件类型: RAR
实验1 最大公约数(包括连续整除、欧几里得、分解质因数算法) 实验2 最近对问题(包括蛮力算法和分治算法) 实验3 最长公共子序列(包括动态规划法) 实验4 最大子段和问题(包括蛮力算法、分治算法和动态规划算法) 实验5 背包、01背包问题(包括贪心算法和分治算法) 实验6 n皇后_2009(包括回溯算法) 以上几个实验基本上都是采用不同的算法实现,所有代码均为原创。

文件下载

资源详情

[{"title":"( 36 个子文件 409KB ) 算法分析与设计实验 Java 实现","children":[{"title":"算法分析与设计 实验Java源代码","children":[{"title":"实验6 n皇后_2009.ppt <span style='color:#111;'> 272.00KB </span>","children":null,"spread":false},{"title":"实验2 最近对问题.ppt <span style='color:#111;'> 126.50KB </span>","children":null,"spread":false},{"title":"实验3 最长公共子序列.ppt <span style='color:#111;'> 100.50KB </span>","children":null,"spread":false},{"title":"0-1背包 回溯 Java.txt <span style='color:#111;'> 2.84KB </span>","children":null,"spread":false},{"title":"实验1 最大公约数.ppt <span style='color:#111;'> 131.00KB </span>","children":null,"spread":false},{"title":"实验4 最大子段和问题.ppt <span style='color:#111;'> 133.50KB </span>","children":null,"spread":false},{"title":"实验5 背包、01背包问题.ppt <span style='color:#111;'> 244.00KB </span>","children":null,"spread":false},{"title":"关于计算java程序运行时间.txt <span style='color:#111;'> 574B </span>","children":null,"spread":false},{"title":"将一个正整数分解质因数.txt <span style='color:#111;'> 697B </span>","children":null,"spread":false},{"title":"Java 实现","children":[{"title":"LargestSubsegmentSum3.java <span style='color:#111;'> 1.20KB </span>","children":null,"spread":false},{"title":"GreatestCommonDivisor1.class <span style='color:#111;'> 1.39KB </span>","children":null,"spread":false},{"title":"SortTest.java <span style='color:#111;'> 11.05KB </span>","children":null,"spread":false},{"title":"LargestSubsegmentSum1.class <span style='color:#111;'> 1.76KB </span>","children":null,"spread":false},{"title":"LargestSubsegmentSum2.class <span style='color:#111;'> 2.20KB </span>","children":null,"spread":false},{"title":"NQueen.java <span style='color:#111;'> 1.33KB </span>","children":null,"spread":false},{"title":"GreatestCommonDivisor2.java <span style='color:#111;'> 718B </span>","children":null,"spread":false},{"title":"KnapSack1.java <span style='color:#111;'> 2.16KB </span>","children":null,"spread":false},{"title":"SortTest.class <span style='color:#111;'> 4.08KB </span>","children":null,"spread":false},{"title":"ClosestPair1.class <span style='color:#111;'> 2.15KB </span>","children":null,"spread":false},{"title":"KnapSack1.class <span style='color:#111;'> 2.71KB </span>","children":null,"spread":false},{"title":"ClosestPair2.java <span style='color:#111;'> 6.08KB </span>","children":null,"spread":false},{"title":"GreatestCommonDivisor3.java <span style='color:#111;'> 1.79KB </span>","children":null,"spread":false},{"title":"LargestSubsegmentSum3.class <span style='color:#111;'> 1.83KB </span>","children":null,"spread":false},{"title":"GreatestCommonDivisor3.class <span style='color:#111;'> 2.43KB </span>","children":null,"spread":false},{"title":"NQueen.class <span style='color:#111;'> 1.95KB </span>","children":null,"spread":false},{"title":"ClosestPair2.class <span style='color:#111;'> 4.46KB </span>","children":null,"spread":false},{"title":"GreatestCommonDivisor1.java <span style='color:#111;'> 736B </span>","children":null,"spread":false},{"title":"Point.class <span style='color:#111;'> 584B </span>","children":null,"spread":false},{"title":"KnapSack2.class <span style='color:#111;'> 2.78KB </span>","children":null,"spread":false},{"title":"LongestCommonSubstring.java <span style='color:#111;'> 1.89KB </span>","children":null,"spread":false},{"title":"KnapSack2.java <span style='color:#111;'> 2.35KB </span>","children":null,"spread":false},{"title":"LargestSubsegmentSum1.java <span style='color:#111;'> 1.13KB </span>","children":null,"spread":false},{"title":"LongestCommonSubstring.class <span style='color:#111;'> 2.51KB </span>","children":null,"spread":false},{"title":"LargestSubsegmentSum2.java <span style='color:#111;'> 1.68KB </span>","children":null,"spread":false},{"title":"GreatestCommonDivisor2.class <span style='color:#111;'> 1.38KB </span>","children":null,"spread":false},{"title":"ClosestPair1.java <span style='color:#111;'> 1.55KB </span>","children":null,"spread":false}],"spread":false}],"spread":true}],"spread":true}]

评论信息

免责申明

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