luciferLanguage

设计一个表达式求值的程序。该程序必须可以接受包含（，），+，-，*，/的中缀表达式，并求出结果。如果表达式正确，则输出表达式的结果；如果表达式非法，则不输出或输出其他字符。(Design an expression evaluation procedures. The program must accept (,), including +, -, *, / the infix expression, and the results obtained. If the expression is correct, the output of the expression is output; if the expression is illegal, no other characters are output or exported.)

实现折半查找，非递归形式，从而实现数据结构所要的结果。(To achieve binary search, the non-recursive form)

大二时做的一个数据结构的课程设计，用2-3树实现的图书馆管理系统，只是控制台程序，没有很好的图形界面。包括管理员、读者。管理员功能有：采编入库、查看图书、查看读者、删除读者。读者功能有：借书、还书、预约、查找等等。。功能全面。包括注册账号，登录需要账号密码。(Sophomore to do a data structure of the curriculum design, with 2-3 tree implementation of library management system, but the console program, not a good graphical interface. Including administrators, readers. Administrator functions include: editing storage, check books, check readers, delete readers. Reader functions: library, book, booking, search and so on. . Full-featured. Including the registration account, login account password required. )

假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 (Suppose you want to arrange a number of activities in the hall more than enough, and want to use as little as possible venue. Design an effective greedy algorithm arrangements. (This problem is actually well-known graph coloring problem. If each activity as a vertex map, with the side connected between incompatible activities. Makes coloring adjacent vertices with minimum number of different colors, corresponding to looking The minimum number of venue.) K to be arranged for a given activity, calculated using a minimum of venue programming schedule.)

数据结构上机操作实验的实验1，线性表的基本操作！！！(the basic operation of sq of date structure)

总结了10种排序的方式。用代码加以实现。(the ten way of Line up a preface)

画图法实验数据结构中二叉树先序、中序、后序遍历和显示。(Paint Method in the first order binary tree data structure, in order, post order traversal and display.)

双向链表 清华大学 出版社 《数据结构 C++》 源代码实现(Tsinghua University Press doubly linked list <data structure, C++> source code)

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

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