-
yu992324
总结了10种排序的方式。用代码加以实现。(the ten way of Line up a preface)
- 2010-07-29 09:41:07下载
- 积分：1
-
mapsearch
数据结构，关键路径问题，设计并实现关键路径的一种应用，采用图的算法(Data structure, critical path problem, using graph algorithm)
- 2016-01-09 17:34:45下载
- 积分：1
-
B_Tree
用控制台实现了经典的数据结构B树，可以通过测试文件.txt加载已有的B树，有插入，删除，查找的功能，加深对数据结构的理解。(Using the console to achieve the classic B tree data structure, you can pass the test document. Txt already loaded B-tree, there are insert, delete, search functions, to deepen understanding of the data structure.)
- 2020-10-18 17:47:26下载
- 积分：1
-
c++最小生成树顶点路径长度及路径计算
文件 a.txt为 输入文件，包括 顶点 和 顶点之间的距离。
文件 b.docx为图示。
输出 距离“999999”表示两点之间没有边。
- 2022-07-10 17:50:46下载
- 积分：1
-
zhaose
本代码是通过C语言来实现贪心算法求着色问题,包括具体问题和实现代码(This code is the C language to implement the greedy algorithm for the coloring problem, including specific issues and the implementation code)
- 2013-09-23 16:04:24下载
- 积分：1
-
maze
通过学习奥赛培训课程，利用回溯加递归的编程技巧完成的迷宫问题(Training courses through learning Orsay, plus use of recursive programming skills back to complete the maze problem)
- 2010-09-02 21:43:32下载
- 积分：1
-
huisuo
实现回溯算法，能解决八皇后问题等～～算法结果优化，时间复杂度较小(Implement backtracking algorithms can solve the eight queens problem, etc. ~ ~)
- 2011-12-14 11:59:39下载
- 积分：1
-
ASDESGTree-Search
论文 <A Study of Decision Error in Selective Game Tree Search>(paper <A Study of Decision Error in Selective Game Tree Search>)
- 2011-04-26 23:10:26下载
- 积分：1
-
Detailed-analysis-of-Uboot
详细分析了Uboot1.6的流程、主要的数据结构，及一些重要细节。(Uboot1.6 startup code integrity analysis)
- 2014-11-28 19:08:52下载
- 积分：1
-
test
某公司收到若干报价，然后报价由低到高进行排序。设最低报价为F,最高报价为G。n=0.2*(G-F)
设A，B，C，D，E五个等距区间并取：
A=[F,F+n） B=[F+n,F+2n) C=[F+2n,F+3n) D=[F+3n,F+4n) E=[F+4n,G)
所有的报价都按各自的大小，分别列入上面五个区间。各自区间内的最小报价为该区间的代表报价。如果某区间内没有报价 则以小于该区间的且与该区间相邻的区间内的最高报价代表该区间报价，如果该区间与与之相邻的较小区间内都没有报价则该区间不参加最后计算。取各区间的代表值， 求出其平均值 做为评标基准报价
(A company received a number of quotations, and quotations from low to high order. Minimum price for the F, the highest offer for the G. n = 0.2* (GF) Let A, B, C, D, E, and five equidistant intervals obtained: A = [F, F+ n) B = [F+ n, F+2 n) C = [F+ 2n, F+3 n) D = [F+3 n, F+4 n) E = [F+4 n, G) All quotes are by their size, five were included in the above range. The minimum offer their own range representative of the range quoted. If a range does not offer less than the range of places and range of adjacent intervals with the highest offer within the offer on behalf of the interval, if the interval and the adjacent smaller range do not offer the range not to participate the final calculation. Take the representative value of each interval, calculate the average price as a benchmark evaluation)
- 2011-11-10 22:44:43下载
- 积分：1
