d

工作时单元功能实现的部分资料 主要涉及字符串处理、排序算法，字符串查询、kmp、改进二分法、Unicode编码、uniq(functional modules work to achieve some of the information involved mainly string handling, sorting algorithm, string inquiries, kmp improve dichotomy, Unicode encoding, uniq)

用模板实现了单向链表的增删改查等功能，并且适用于多种数据结构和类，简单实用，是学习和使用的绝好资料(Template to achieve a one-way linked list CRUD functions, and is suitable for a variety of data structures and classes, simple and practical, is to learn and use excellent information)

排序程序,包含快速排序、归并排序、谢尔排序、插入排序。输出了比较次数和移动次数。(It is a sort program, including quick sort, merge sort, shell sort and insert sort.It outputs the compare times and movement times.)

代码注重B树插入、删除的算法逻辑，适用于 学习者研究B树实现的核心思想。代码中无庞杂的无关操作(focus on B-tree code insertion, deletion algorithm logic applies to B-tree research learners to achieve the core idea. The code has nothing to do with the complex operation )

自己用c语言写的一个模块化多电平最近电平调制排序的c程序，希望对大家有帮助(Own use c language written in a modular multi-level modulation level recently sort of c program, we hope to help)

归并排序,复习排序算法，在不同环境下，寻找时间复杂度最少的排序算法( Merge sort, review sorting algorithm, in different contexts, looking for the least time complexity of sorting algorithm)

这是acm高手楼天城的比赛代码，很有用哦，对于提高算法非常有用(This is a master of building Tiancheng acm game code, very useful oh, for improving the algorithm)

说明：  从最后一个非叶子结点开始从后往前进行调整，保证了根下的所有子树都是最大堆，最后对根进行调整，使整棵二叉树为最大堆，保证了根结点为整棵数的最大值点，完成了建堆的过程，再将根结点跟最后一个结点进行交换，如此反复操作，则堆排序就完成了，其中堆排序的过程采用了满二叉树的概念。(From the final of a non-leaf node after the move began to be adjusted to ensure that the root of all sub-tree are the biggest pile, and finally adjusted to the root, so that the largest heap binary tree整棵to ensure that the root node for整棵the maximum number of points, completed the process of building reactors, and then the last root node with a node to be exchanged, and so repeated the operation, then HEAPSORT completed, of which the process of HEAPSORT a full binary tree concept.)

哈希表 数据结构课程设计 1.1问题描述 针对自己的班集体中的“人名”设计一个哈希表，使得平均查找长度不超过R，完成相应的建表和查表程序。 1.2基本要求 假设人名为中国姓名的汉语拼音形式。待填入哈希表的人名共有30个，取平均查找长度的上限为2。构造哈希函数，用链表法处理冲突。 1.3测试数据 读取熟悉的30个人的姓名作测试。(Hash table Data Structure Course Design 1.1 Description of the problem For their own class group of the "names" to design a hash table, making the average search length does not exceed R, the completion of construction of tables and look-up table corresponding procedures. 1.2 Basic requirements Assuming the name of the person called Chinese pinyin form. To be filled into a hash table names a total of 30, taking the average search length of the upper limit of 2. Construct a hash function, treatment with a list of conflict. 1.3 Test Data Read the familiar names of 30 individuals tested.)

说明：  可以实现判断二叉树是否为完全二叉树、判断两棵二叉树是否镜像对称、求一棵二叉树的一个最长枝等功能(Can determine whether the binary tree is complete binary tree to determine whether two binary mirror symmetry, one of the longest seeking a binary tree branches and other functions)