-
a directory procedures, Access databases, ODBC
一个通讯录程序，Access 数据库，ODBC-a directory procedures, Access databases, ODBC
- 2022-02-21 07:43:10下载
- 积分：1
-
是一个很好的c++家族管理系统
是一个很好的c++家族管理系统-is a good family management system c
- 2022-05-05 17:27:01下载
- 积分：1
-
java通过ODBC JDBC桥完成数据库的操作简单代码
java通过ODBC JDBC桥完成数据库的操作简单代码-java through ODBC database JDBC Bridge completed the simple code
- 2022-01-28 01:55:48下载
- 积分：1
-
不同类型的文本和返回信息的解析库
library for parsing xml text and returning information of different type
- 2022-07-05 06:09:07下载
- 积分：1
-
用于车辆管理与监控，实现车辆登记查询与帮助
用于车辆管理与监控，实现车辆登记查询与帮助
- 2022-01-30 18:06:44下载
- 积分：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
-
libaly为OrCAD 16.2
libaly for orcad 16.2
- 2023-04-30 12:40:13下载
- 积分：1
-
该源代码利用计算机模拟乘法竖式 计算阶乘
将每位数子保存在用new分配的一长字符数组里 在本人的机子上可计算30000!的精确值 用时近60秒...
该源代码利用计算机模拟乘法竖式 计算阶乘
将每位数子保存在用new分配的一长字符数组里 在本人的机子上可计算30000!的精确值 用时近60秒-the source code used a computer simulation multiplication calculation factorial shaft will be preserved for each digit used in the distribution of a new long arrays of characters in my machine on computable 30,000! The precise value of time spent nearly 60 seconds
- 2022-03-21 21:13:08下载
- 积分：1
-
achieve internal order. Including bubble sort, direct insertion sort, Shell sort...
实现各种内部排序。包括冒泡排序，直接插入排序，Shell排序，快速排序，堆排序，并比较排序的比较次数和移动次数。主要是C语言。-achieve internal order. Including bubble sort, direct insertion sort, Shell sort, quick sort, heap sort, and compare the ranking of number and mobile number. C is the main language.
- 2022-06-15 22:52:45下载
- 积分：1
-
数据结构编程 实现数的插入
数据结构编程 实现数的插入-data structure programming several of the insert, etc.
- 2022-12-21 23:25:03下载
- 积分：1
