Prime number algorithm of the program to quickly calculate the first n a prime n...

比较简陋的数据库应用,唯一能看的就是对ODBC的封装-Comparison of simple database application, is the only way to look at the package of ODBC ...

二叉树应用-线索化二叉树遍历的源码以及实验报告！-Binary Tree Application- threaded binary tree traversal of the source and the experimental report!

Fibonacci数列的c语言实现-Fibonacci Sequence C Language

三级网络技术上机题答案-three-network technology that answers

Data Structures and Program Design in C++ 书中源代码 作者Robert Kruse, Alexander Ryba

最接近点对问题，分治法实现，随机生成N个数寻找最短路径的两个点-closest point of the problem, realizing the partition method, random number generation N to find the shortest path to the two points

用QUERY控件与 Table控件的database management.-with QUERY control and Table Controls database management.

这是一个数据结构常用的算法叫huffman编码.是对一棵二叉树进行huffman编码的算法-This is a common data structure called Huffman coding algorithm. For a binary tree for Huffman coding algorithm

Thalmann算法的java实现。有详细注释。-Thalmann algorithm to achieve the java. Notes detail.

自己做的 借书管理系统-own library management system