floy

VC简易通讯录，加强C的编程，熟悉链表文件的使用等。(Simple VC contacts, strengthen C programming, familiar with the use of a linked list file.)

大学软件工程数据结构课程设计二叉树实验三种遍历方法(curriculum design,structure data)

.h文件。c++中的复数类，能够直接完成基本四则运算，输入输出流，完成一定范围内的比较运算(. H file. c++ classes in the plural, to directly perform basic arithmetic, input and output streams, to complete a range of comparison operators)

根据所选定的字符顺序，按照从大到小的规则，对字符进行插入排序，(Insert and sort characters)

数据结构的稀疏矩阵的几部分操作，广工的课程设计(Sparse matrix operations)

算法课程设计 分治法解决循环赛日程表 源代码+word报告+答辩PPT(Curriculum design of divide and conquer algorithm to solve a round robin schedule report+ source code+ word reply PPT)

用C语言实现的普通快速排序，和随机快速排序进行对比(With ordinary C language implementation of quick sort, quick sort and compare the random)

思塞恩算法 常用算法之一 算法导论提及(strassen algorithm which can run correctly)

/*快速排序：以待排序元素中的第一个元素作为基准将带排序的元素分为三组 *大于基准元素为一组置于基准值的右边，小于基准值的元素为一组置于基准值的左边， *基准值为一组，这样就找到了基准元素的位置就确定了 *如此递归调用。直到每一组的low==high，即实现了排序的要求。 */ (/* Rapid Sort: the first element to be sorted in the element as a basis with with sorting the elements are divided into three groups* is greater than the reference element of a group is placed on the right side of the reference value, smaller than the reference value elements for a group of placed on the left side of the reference value,* reference value, a group, so that the location of the reference element is found it is determined* so recursive call. Until each group of low == high to achieve the requirements of the sort.* /)

简单LR语法分析程序自动生成器的实现，可用作数据结构课程设计(LR (0) grammar analysis)