医院挂号系统叫号系统

C数据结构 第七章 树-C data structures Chapter VII of the tr

ORACLE数据库得建表语句-ORACLE database built in Table statement

你好 我开发了此应用程序只用了 1 天，我相信你们都喜欢这个应用程序，并且学到很多东西特别是初学者。 谢谢你 J@n@k

常用的几种排序算法的实现源码，同时还给出了几种排序算法的比较结果，源码中的排序内容都是随机产生的-several commonly used algorithm to achieve source, but also gives several algorithm result of the comparison, the ranking source content are randomly generated

一个快速查询控件，不直接与数据库发生关系，查询速度极快，值得一试-A quick query controls, not a relationship directly with the database, query speed, it is worth a try

求图的任两结点间的距离，(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

这是为初学者提供的，可以在短时间内学会，只要你有耐心，只要你有恒心，你就会学会，真的一点也不难。只要你肯下功夫。

addlist very good please download it

二叉树遍历 包括先序遍历 中序遍历 后序遍历 求结点个数 求树的深度-Including the first order binary tree traversal traversal sequence in order to postorder traversal node number and ask for the depth of

非常完整的电梯模拟系统 欢迎大家提出宝贵建议-this a complete system of simulating the elevetor,welcome to your advice,thank you