这是清华电子的一个作业题，功能上实现寻求最短的8位数组包含所有数字连接且开头结尾分别包含了所有10个数字...

C语言实现数据结构中最短路径的算法代码，有图形显示。欢迎下载-C language data structure, the shortest path algorithm code, a graphical display. Welcome to download

基于c++的代码，通过单链表实现求和、求积。编写一个程序用单链表存储多项式，按指数从大到小排序多项式，并实现两个多项式的相加和相减

Visual C#数据库开发中 简单论坛的开发sql2000数据库-Visual C# Database development in a simple forum for the development of SQL2000 database

数 据 结 构 大型 作业3.1输入一个数列L，生成一棵二叉排序树T；3.2对二叉排序树T作中序遍历，输出结果；3.3计算二叉排序树T的平均查找长度, 输出结果；3.4判断二叉排序树T是否为平衡二叉树，输出信息“OK！”/“NO！”；3.5再使用上述数列L，生成平衡的二叉排序树BT，每当插入新元素，发现当前的二叉排序树BT不是平衡的二叉排序树，则立即将它转换成新的平衡的二叉排序树BT；3.6计算平衡的二叉排序树BT的平均查找长度，输出结果。3.6分析对比未平衡化的二叉排序树和平衡的二叉排序树的查找效率(最好、最坏平均比较关键字数)-data structure large operations into a 3.1 L series, generating a binary tree Sort T; 3.2 pair of two fork-tree T for medium preorder, output results; 3.3 Ranking calculation Binary Tree Search T"s average length of the output; 3. four judgment ordering two trees T fork whether balanced binary tree, the output message "OK!"/"NO!" ; again using the 3.5 series L, generate balanced binary tree sort BT, whenever insert a new element, found the current binary sort tree is not-BT Value of two binary sort tree, it will be immediately converted into the new balance of the two fork-tree BT; 3.6 Calculation balanced binary tree sort BT search length of the average output results. 3.6 Comparative Analysis of

基于C语言的各种典型排序算法：插入排序，气泡排序，希尔排序，快速排序，选择排序。可以用VC直接编译运行。-Based on the C language provides a variety of sorting algorithms: insertion sort, bubble sort, Shell sort, quick sort, selection sort. VC can be directly translated to run.

POJ1840求一个有5位未知数方程解的个数,hash表的经典应用-POJ1840 seeking a five unknown number of equations, hash table classic application

jdbc连接db2范例,非常完整,我找了很久,供学习参考-jdbc connecting db2 example, the very integrity, I look for a long time for study reference

支持并发访问的B+树-support concurrent visit the B-tree

堆排序:思想: 用二叉树的结构来表示数组,及用数组来表示二叉树的结构,比如i为父节点其孩子为,2i,和2i+1.其中,大顶堆中 父节点大于其两个孩子 算法平均时间复杂度: O(nlogn) -HEAPSORT: thinking: using binary tree structure to express the array, and used to express an array of binary tree structure, such as i the parent node for its children, 2i, and 2i+ 1. Among them, the big top of a pile of the parent node greater than two children on average time complexity of algorithm: O (nlogn)

一个小型的嵌入式数据库，支持SQL命令，使用非常简单-a small embedded database support SQL commands, the use of very simple