Anorldi

本代码主要实现了哈希表的设计，完成了哈希函数的相关要求。(The code is designed to achieve a hash table, the completion of the relevant requirements of the hash function.)

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

说明：  a set of uestc computer academic matu

这是一个堆排序的算法源程序，算法被单独写成一个函数，希望对大家有用(This is a heap sort algorithm source code, algorithms are written as a separate function, we hope to be useful)

参加运动会的 个学校编号为 。比赛分成 个男子项目和 个女子项目，项目编号分别为 和 。由于各项目参加人数差别较大，有些项目取前五名，得分顺序为7，5，3，2，1；还有些项目只取前三名，得分顺序为5，3，2。写一个统计程序产生各种成绩单和得分报表。 2、要求产生各学校的成绩单，内容包括各校所取得的每项成绩的项目号、名次（成绩）、姓名和得分；产生团体总分报表，内容包括校号、男子团体总分、女子团体总分和团体总分。 3、测试数据：对于 ， ， ，编号为奇数的项目取前五名，编号为偶数的项目取前三名，设计一组实例数据。 (The school serial number participating in Games is. Competition divides into men s event and women s event , the project serial number parts for the sum. The difference is bigger since every project participates in a number , some projects choose the first five , score order is 7 , 5 , 3 , 2 , 1 Still have some of projects taking the first three places , score only being 5 , 3 , 2 in proper order. Write a form for report counting procedure producing the various school report card and score. 2, demands the school report card producing every school , content includes every achievement project number , position in a name list (achievement) , full name and score per got by school Produce the group total points form for report , content including the school number , male person group total points , woman group total points and group total points. 3, testing data: Be that the odd number project chooses the first five to the serial number, the serial number is that the even number project c)

讲解了循环单链表的建立，以及在链表中插入、删除、更改数据...(Explain the establishment of circular single linked list, and insert in the list, delete, change the data ...)

用c++实现的haffman tree 小程序，仅供参考 。 (The the haffman tree applet realized with c++ for reference only.)

链表，输入一定的数据，通过链表进行储存，并排序后输出。(List。Input numbers,then output in order~~)

江苏大学数据结构研究生试题2009Jiangsu University graduate examination papers(Jiangsu University graduate examination papers)

说明：  进程死锁.资源分配图的绘制 建立所需数据结构；  使用题目21存成的资源分配图的文件作为输入；  编写资源分配图化简算法；  每化简一步，在屏幕上显示化简的当前结果；  最后给出结论，是否死锁，如思索给出死锁的进程及资源； (Process deadlock. Resource allocation mapping  establish the required data structures  Use title 21 deposit into resource allocation graph file as input  writing resource allocation map simplification algorithm  Each simplification step, on-screen display simplification of the current result  Finally, the conclusion of a deadlock, deadlock is given as thinking processes and resources )