-
数据结构上让我们编写的排序算法，有冒泡，堆排序等
数据结构上让我们编写的排序算法，有冒泡，堆排序等-Data structure so that we prepared on sorting algorithms, there are bubble, heap sort, etc.
- 2022-02-14 13:40:58下载
- 积分：1
-
experiment data structure of all experimental procedures, but I individually tes...
数据结构实验课中的所有实验程序，这可是本人逐个测试过的，绝对精品，-experiment data structure of all experimental procedures, but I individually tested, absolute masterpieces,
- 2022-11-25 03:50:03下载
- 积分：1
-
Memory Decoder
Memory Decoder
- 2022-03-25 05:30:59下载
- 积分：1
-
NexusDB 2.07 Embedded Free Edition (for Delphi2006)
NexusDB 2.07 Embedded Free Edition (for Delphi2006)
- 2023-05-30 05:25:04下载
- 积分：1
-
PB9.0 generated student information management system, to complete the student i...
PB9.0生成的学生信息管理系统，能完成学生信息的增加，删除，修改等基本操作。后缀为db的是数据库文件-PB9.0 generated student information management system, to complete the student information to add, delete, modify the basic operation. Db suffix to the database file
- 2022-01-26 03:08:04下载
- 积分：1
-
3X3填质数问题，在一个3×3的矩阵中填写1－10的数字，保证上下左右相加都是质数...
3X3填质数问题，在一个3×3的矩阵中填写1－10的数字，保证上下左右相加都是质数-3X3 fill several quality problems in a 3 3 matrix to fill in the figures 1-10, ensuring that all about is the sum of the number of quality
- 2023-07-03 08:00:04下载
- 积分：1
-
在长
在远距离数据通信中，为确保高效而无差错地传送数据，必须对数据进行校验即差错控制。循环冗余校验CRC(Cyclic Redundancy Check/Code)是对一个传送数据块进行校验，是一种高效的差错控制方法。-in long-distance data communication, in order to ensure efficient without error to transmit data, the data must check that the error control. Cyclic Redundancy Check (Cyclic Redundancy Check/Code) is to block transmission of data over a check out, is a highly efficient error control methods.
- 2022-05-28 22:54:07下载
- 积分：1
-
circular linked list node wait
环形链表结点出排-circular linked list node wait-
- 2022-02-27 07:00:39下载
- 积分：1
-
旅游管理系统1分为12类模块，4个模块，一个VB…
旅游管理系统一共分12个类模块,4个模块,一个VB开发的旅游信息管理系统，很完整使用-Travel Management System 1 is divided into 12 categories module, 4 modules, a VB development of tourism information management system, it is full access! ! !
- 2022-01-24 16:29:27下载
- 积分：1
-
Order to map any of the distance between two nodes, (2) with two
求图的任两结点间的距离，(2) 用二维数组存放C和A ，C是原成本矩阵，A 是求出的距离矩阵
(3) 算法采用三重循环，其中最外层的循环变量必须代表中间结点，中层的循环变量代表头结点而内层循环变量代表尾结点。
(4) 试着把三层循环变量的顺序作些改变，最外层的循环变量仍代表中间结点，而中层循环变量代表尾结点，内层循环变量代表头结点。把两种做法所得结果作比较,看结果是否相同
(5) 显示结果要清晰易懂
(6) 本题运行结果
-Order to map any of the distance between two nodes, (2) with two-dimensional array of storage C, A, C is the original cost matrix, A is to find the distance matrix (3) The algorithm uses the triple loop, one of the most outer loop variable must be representative of intermediate nodes, the middle loop variable represents the first node and the inner loop variable represents the end nodes. (4) tried to three-loop order of the variables to make some changes, the most outer loop variables still represent intermediate nodes, while the middle loop variable represents the end nodes, the inner loop variable represents the first node. The two approaches to compare the results to see whether the results the same (5) shows the results must be clear and understandable (6) The q
- 2022-04-20 12:55:19下载
- 积分：1
