ysph

排序，各种排序算法，插入排序，冒泡排序，快速排序，等等！(Sorting, various sorting algorithms, insertion sort, bubble sort, quick sort, and more!)

说明：  线性表的基本运算及多项式的算术运算在顺序表泪SeqList 中增加成员函数void Reverse()实现顺序表的逆置 (Linear form the basic arithmetic operations and the polynomial form in order to increase tear SeqList member function void Reverse () to achieve the inverse order of the table set)

使用C语言完成党的霍夫曼编码，主要使用树的数据结构，作为巩固数据结构的练习(Using the C language to complete the party' s Huffman coding, the main use of the tree data structure, data structure as a consolidation exercise)

Hanoi塔问题非递归算法实现，几个具体的实现算法(Tower of Hanoi non-recursive algorithm, the realization of a number of specific algorithms)

设有一头指针为L的带有表头结点的非循环双向链表，其每个结点中除有prev（前驱指针），data（数据）和next（后继指针）域外，还有一个访问频度域freq。在链表被起用前，其值均初始化为零。每当在链表中进行一次Locate(L,x)运算时，令元素值为x的结点中freq域的值增1，并使此链表中结点保持按访问频度非增（递减）的顺序排列，同时最近访问的结点排在频度相同的结点的最后，以便使频繁访问的结点总是靠近表头。试编写符合上述要求的Locate(L,x)运算的算法，该运算为函数过程，返回找到结点的地址，类型为指针型。(Has a head pointer is non-circular doubly linked list L with a header node, each node in addition to prev (precursor pointer), data (data) and next (successor pointers) outside, there is an access frequency degree domain freq. Before the list was hired, their values are initialized to zero. Whenever carried out in the list once Locate (L, x) when the operation, so that the element node x is the value in freq domain by one, and keep this list in the node-access frequency of non-increasing (decreasing) the order, while a recent visit to the nodes in the same row of the frequency of the last node, so that the nodes are frequently accessed tables are always near the head. Locate (L, x) algorithm is prepared in accordance with the above requirements of the test operation, the operation as a function of the process, return to find the address of the node of type pointer.)

高德纳发明的高效数据结构dancing link，这里是解重复覆盖问题的一个演示(Donald Knuth invented efficient data structure dancing link, here is the solution to repeat coverage of a demonstration)

二叉树的先序遍历。采用递归实现。释放资源时用了后序遍历。(Preorder traversal of a binary tree. Recursive implementation. Release resources used after preorder.)

描述：足球俱乐部包括球员、普通行政人员。球员有姓名、年龄、能力、年薪、转会费、进球总数、服役年限等重要参数；普通行政人员有姓名、年龄、能力、年薪等参数。你需要给相关管理机构开发一个管理程序，实现对众多足球俱乐部管理的基本功能。具体功能包括： a) 俱乐部的增删改查，俱乐部的属性包括名称、现金、其下人员； b) 可以对所有球员的各项属性进行简单搜索，支持输入多个条件，条件之间用&&连接，例如： i. “年龄不大于25且服役年限大于5年且进球数大于100的球员”，查询表达式：!(@age>25) && @experience>5 && @kick>100 c) 支持球员在不同俱乐部间的买卖，买卖需符合以下条件：作为买方的俱乐部的现金>=球员的转会费，交易完成后，卖方将得到转会费。 要求： d) 必须采用面向对象的方式，使用类组织数据结构，并注意类的继承关系； e) 在题目要求基础上可以自行扩展功能，提供扩实用扩展功能者适当加分（加分不超过5分）。 (Description: Football club including players, general administrative staff. Player name, age, ability, salary, transfer fee, total number of goals, service life and other important parameters ordinary administrative staff name, age, ability, salary and other parameters. You need to give the relevant management agencies to develop a management program to achieve the number of football club management s basic functions. Specific features include: a) the club CRUD, the name of the club s property, including cash, under which personnel b) all players can perform a simple search of the property, supports input multiple conditions with && connection between conditions, for example: i. "Age is not greater than 25 and greater than 5 years service life and goals more than 100 players," query expression:! (@ age> 25) && @ experience> 5 && @ kick> 100 c) Support the players traded between different clubs, the sale subject to the following conditions: As a buyer s club cash> = pl)

简单的迷宫问题，有点土，还望大家多指点指点，在此感激不尽。(????? mad spasm, ? Tang Gao, ? oligonucleotide ??? Ning Ning ? ?, Hitomi ?????.)

提供字符串方法，大家面试可以用，包括找出对称字串(Some string function)