-
Shortest Path Problem Description C
最短路径问题C++描述-Shortest Path Problem Description C
- 2022-01-27 14:10:42下载
- 积分:1
-
SHELL排序算法与应用
SHELL排序算法与应用-SHELL algorithm and application
- 2022-03-22 23:07:56下载
- 积分:1
-
图的邻接矩阵存储结构
图的优先深度遍历
图的邻接矩阵存储结构
图的优先深度遍历-Graph adjacency matrix storage structure of the priority depth traversal
- 2022-03-24 13:40:02下载
- 积分:1
-
几种基本的排序算法 ,希望对某些人有点帮助
几种基本的排序算法 ,希望对某些人有点帮助-several basic sorting algorithm, and I hope to help some people a bit
- 2022-03-25 10:14:56下载
- 积分:1
-
vb做的
vb做的-教学计划安排与排课系统-vb do-teaching plans and Timetable
- 2022-05-08 11:59:26下载
- 积分:1
-
数据结构的查询方式及其应用,是其中的比较重要的一种
数据结构的查询方式及其应用,是其中的比较重要的一种-Query data structure and its applications, is one of the more important a
- 2023-01-02 19:00:03下载
- 积分:1
-
pb 源码 进度条程序
pb 源码 进度条程序-progress of the process
- 2023-05-04 19:50:03下载
- 积分:1
-
从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对...
从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用.
算法平均时间复杂度: O(nlogn)
-Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)
- 2022-03-12 12:50:19下载
- 积分:1
-
VC++语言实现与数据库的连接,效果不错的
VC++语言实现与数据库的连接,效果不错的-VC++ Language with database connectivity, the effect of good
- 2023-03-23 00:00:03下载
- 积分:1
-
算法设计于分析中的多段图问题,用VC编写应用动态规划的算法设计方法,利用最优性原理以及所获得的递推关系式求取最优决策序列,通过多段图的定义,找到由源点s到汇点t...
算法设计于分析中的多段图问题,用VC编写应用动态规划的算法设计方法,利用最优性原理以及所获得的递推关系式求取最优决策序列,通过多段图的定义,找到由源点s到汇点t的最小成本路径,进而可以灵活解决可以用多段图描述的许多实际问题.-algorithm design in the analysis of many of the map, prepared with VC dynamic programming algorithm design, the optimum principle as well as the recursive relation to strike the optimal sequence of decision-making through more of the map defined by the source to find s t point to the Department of the minimum cost paths and further a flexible solution could spend more of the map describes the many practical problems.
- 2022-02-04 19:58:15下载
- 积分:1