-
基于对话框的数据库编程
基于对话框的数据库编程-Database Programming
- 2022-09-01 04:50:02下载
- 积分：1
-
TwoEmbranchmentTree : As ancestor has its children, a tree has its leaves. we co...
TwoEmbranchmentTree:As ancestor has its children , a tree has its leaves.
we could check its leaves in terms of algorithm as preorder , midorder or postorder.-TwoEmbranchmentTree : As ancestor has its children, a tree has its leaves. we could check its leaves i n terms of algorithm as preorder. midorder or postorder.
- 2022-06-12 18:19:19下载
- 积分：1
-
SQL入门使用与高级使用篇。 SQL入门使用与高级使用篇。
SQL入门使用与高级使用篇。 SQL入门使用与高级使用篇。-SQL entry with the use of the use of the High chapter. SQL entry with the use of the use of the High chapter.
- 2022-06-22 04:07:35下载
- 积分：1
-
该源码为酒店等使用的源码，使用java语言编写。具有GUI图形界面，使用jdbc来连接数据库。软件架构很合理，尤其是代码很简洁。...
该源码为酒店等使用的源码，使用java语言编写。具有GUI图形界面，使用jdbc来连接数据库。软件架构很合理，尤其是代码很简洁。-The source for the hotel such as the use of the source, use the java language. Graphical interface with a GUI, use jdbc to connect to database. Software architecture is very reasonable, especially in very concise code.
- 2022-11-05 20:50:03下载
- 积分：1
-
VB图书管理程序
VB 图书馆管理程序-VB library management procedures
- 2022-05-06 16:53:13下载
- 积分：1
-
用C++实现的快速傅立叶变换（FFT）的结构算法，其功用就不用细说了吧...
用C++实现的快速傅立叶变换（FFT）的结构算法，其功用就不用细说了吧-C realized Fast Fourier Transform (FFT) algorithm structure, its purpose would not have to elaborate on it
- 2023-07-26 14:30:04下载
- 积分：1
-
ODBC API访问数据库的文章却少之又少。虽然用ODBC访问数据库比较麻烦，但却很灵活，效率高，
ODBC API访问数据库的文章却少之又少。虽然用ODBC访问数据库比较麻烦，但却很灵活，效率高，-ODBC API to access the database of the article are few and far between. Although access to the database using ODBC is too much trouble, but it is very flexible, high efficiency,
- 2022-07-08 05:31:07下载
- 积分：1
-
Dijkstra算法， Dijkstra算法，Dijkstra算法
Dijkstra算法， Dijkstra算法，Dijkstra算法-Dijkstra algorithm
- 2022-03-22 22:56:13下载
- 积分：1
-
篮球赛抽签系统，先输入球队数，由随机函数在1
篮球赛抽签系统，先输入球队数，由随机函数在1-N抽取一个数，作为初始密码，出列第一支球队，然后根据各队输入本队密码，利用joseph环，使每次出列的球队密码作为新的密码，直到所有球队出列，即可确定分组顺序-Basketball lottery system, first enter the team number by the random function in the 1-N taken a number, as the initial password, the first teams out of the column, and then each team enter the team password, using joseph ring, so that each second team out of the column as a new password password, until all the teams out of the column, you can determine the packet sequence
- 2022-02-03 18:33:48下载
- 积分：1
-
遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是...
遍历是二叉树经常要遇到的一种操作.可以运用到二叉树结点计数,线索化二叉树,求二叉树的深度,表达式求值等算法中.在遍历的过程中,对结点的访问具有普遍的含义,可以是输出各结点的数据域信息,也可以是对结点作其他处理.另外,通过一次完整的遍历,可使二叉树中结点信息由非线性排列变为某种意义上的线性排列.也就是说,遍历操作使非线性结构线性化.
-traverse binary tree is frequently encountered in a operation. Binary Tree can be applied to node count, clues of a binary tree, the binary tree for depth, in the expression evaluates such algorithm. the ergodic process, right node of the visit is universal meaning, it can be output in each node of data domain information, also be on the node for other treatment. Besides, a complete traversal, Binary enables information from the node into a nonlinear with a sense of linear order. In other words, Traversing operation nonlinear structure so linear.
- 2022-02-27 00:08:38下载
- 积分：1
