“四皇后算法”的C语言实现，测试通过的，快来下载啊！

实现二分法求解方程。编写并使用以下函数： double SolveRoot(double(*pf)(double x),double a,double b,int n) 这里，pf指向一个函数f，f用来定义要求解的方程f(x)=0，a和b是未知解x的上下界（即a

我们开发的系统实际上基于三个主要模块。 > 通过打印的所有输入/输出活动记录指纹机上 > 标记出勤 > 消息提醒系统，向每个签入或签出的学生家长。

从数据库抽取数据，用来进行复杂数据的处理-Collected data from the database, used for complex data processing

《数据结构》排序演示系统。实现6种内部排序。包括直接插入排序，希尔排序，冒泡排序，直接选择排序，快速排序，堆排序。。这是我的数据结构课程设计！-"data structure" Sort demonstration system. Six species of achieving internal order. Including direct insertion sort, Hill, in order Bubble Sort, direct selection, in order of Quick Sort, heap sort. . This is my data structure course design!

创建二叉树，并实现二叉树前序、中序递归遍历算法和二叉树的后序非递归遍历-create binary tree, and to achieve binary tree before the sequence, sequence recursive traversal of a binary tree algorithm and after non- recursive traversal sequence

这是一些c语言的常用算法，它可以帮助那些初学c语言的人了解c语言的算法的写法和怎么用的啊-c language commonly used algorithm, it can help those learning the language c c language people understand the wording of the algorithm and how the ah! !

一个商业软件的源码，含数据库，图形等多种操作-A source of commercial software, including databases, graphics and other operating

c语言编写上机运行已经通过,实现多道程序的转换调度（作业调度和进程调度结合在一起）-c languages running on the machine has passed, multiple procedures to achieve the conversion Scheduling (Job Scheduling and Dispatching process combines)

清华大学数据结构习题集答案-QingHua university answer to data structure excise

迷宫问题。以一个 m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论 起点就是方阵中的（1，1）终点就是（m-1，n-1） -Maze. With an m* n matrix, said the long labyrinth of 0 and 1, respectively, the maze of paths and obstacles. Designing a program, for any set of the maze, find a path from the entrance to the export, or come to the conclusion there is no access point is a square matrix of the (1,1) The end is (m-1, n-1)