yuesefu

/*快速排序：以待排序元素中的第一个元素作为基准将带排序的元素分为三组 *大于基准元素为一组置于基准值的右边，小于基准值的元素为一组置于基准值的左边， *基准值为一组，这样就找到了基准元素的位置就确定了 *如此递归调用。直到每一组的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.* /)

利用串来比较数据大小，代码中有两个串，通过串来比较大小( 10/5000 Use the string to compare the data size)

求最长上升下降\非上升非下降的刷表法(Seeking maximum rise fall Philippines rise fall Philippines brush table method)

本代码是通过C语言来实现贪心算法求着色问题,包括具体问题和实现代码(This code is the C language to implement the greedy algorithm for the coloring problem, including specific issues and the implementation code)

本书是《程序员面试宝典》的第三版，在保留第二版的数据结构、面向对象、程序设计等主干的基础上，使用各大IT公司及相关企业最新面试题替换和补充原内容，以反映自第一版以来近几年时间所发生的变化。 　　欧立奇、刘洋、段韬编著的《程序员面试宝典》取材于各大公司面试真题(笔试、口试、电话面试、英语面试，以及逻辑测试和智商测试)，详细分析了应聘程序员(含网络、测试等)职位的常见考点。本书不仅对传统的C系语言考点做了详尽解说，还根据外企出题最新特点，新增加了对友元、Static、图形/音频、树、栈、ERP等问题的深入讲解。最后本书着力讲述了如何进行英语面试和电话面试，并对求职中签约、毁约的注意事项及群体面试进行了解析。本书的面试题除了有详细解析和答案外，对相关知识点还有扩展说明。真正做到了由点成线，举一反三，对读者从求职就业到提升计算机专业知识都有显著帮助。 　　《程序员面试宝典》适合计算机相关专业应届毕业生阅读，也适合作为正在应聘软件行业的相关就业人员和计算机爱好者的参考书。(This book is the" canon" in the third edition, retained in the second version of the data structure, object-oriented program design, main basis, the use of each big IT companies and related enterprises to the latest interview questions substitution and supplement the original content, in order to reflect the since its first edition in recent years since time changes. Ou Liqi, Liu Yang, Duan Tao," canon" drawn from major companies interview questions ( written examination, interview, telephone interview, interview, and logical test and IQ test ), a detailed analysis of the application programmer (including network, testing ) positions of the common points. This book not only to the traditional C language test done a detailed explanation, according to the new characteristics of the new foreign title, added to the friend, Static, graphics/audio, tree, stack, ERP issues in depth explanation. The last book on described how the English interview and telephone interview, and the job of signin)

使用非递归的方法遍历二叉树，可以直接运行。( Non-recursive binary tree traversal.)

迷宫求解一般采用“穷举法”，逐一沿顺时针方向查找相邻块（一共四块－东(右)、南(下)，西(左)、北(上)）是否可通，即该相邻块既是通道块，且不在当前路径上。用一个栈来记录已走过的路径栈是限定仅在表尾(top)进行插入或删除操作的线性表。(Maze solving generally use the " exhaustive" one by one to find adjacent blocks in a clockwise direction (a total of four- East (right), South (down), West (left), North (on)) whether to pass, that the both channel blocks adjacent blocks, and not in the current path. Use a stack to record the path traversed stack is limited only in the tail (top) to insert or delete a linear form.)

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

二叉树实现，整个包为VS工程。包含了二叉树的基本功能(Binary Tree, the entire package is VS works. Contains the basic functions of the binary tree)

实现对二叉树的操作：建树、遍历、求层高、叶子数和结点数等(binary tree)