Ex1

在N*N的棋盘上(1<=N<=10)填入1,2,...N*N共N*N个数,使得任意两个相邻的数之和为素数. (In the N* N chessboard (1 < = N < = 10) filled 1,2, ... N* N total number of N* N so that any two adjacent numbers and prime numbers.)

字符串，实现了文件中查找想要的字符串，并将其标记出来

一个关于约瑟夫环问题的经典算法编程的C语言实现(the program about JOSEPHUS)

This is a C++ code. It finds out if the tree is a binary search tree (BST)or not, where the BST is one of data structures types.

实现折半查找，非递归形式，从而实现数据结构所要的结果。(To achieve binary search, the non-recursive form)

题意:给你n个数,求出两两组合的最大公约数 类似打素数表的做法 (Meaning of the questions: to give you the number n, find greatest common divisor of a similar combination twenty-two hit the practice table of prime numbers)

将一组数组转换为哈夫曼编码，使用数据结构中的二叉树功能实现(Convert an array to Haffman code)

X位赋0mintest是实现芯片功耗测试不确定位填充算法(X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm)

纯C语言写的小型通用数据库，一个C数据结构组科技小组的作品，附有开发思路PPT，这可是一个宝贵的资源哦，更底层的东西，运行于DOS提示符，可以新建数据库等操作。C的编程高手们值得参考一下。 (Pure C language to write a small general-purpose database, a data structure C Group Technology Group works to develop ideas with PPT, this is a valuable resource Oh, and the bottom of things, running on the DOS prompt, you can operate a new database. C programming masters worthy of reference.)

数据挖掘中聚类算发中基于密度的算法DBSCAN(Hair count data mining clustering algorithm DBSCAN density-based)