熟练掌握并灵活运用C语言知识点，特别是指针和结构，以及文件操作。 熟练掌握并灵活运用常见的数据结构数组,链表和树。 熟练掌握并灵活运用相关的检索与排序算法。 -Proficiency and flexibility in the use of the C language knowledge, especially pointer and structure, as well as file operations. Proficiency and flexibility in the

对数组元素排序 任意进制数的转换 判断回文数(Sort the array elements Conversion of arbitrary numbers Determine the number of palindrome)

这里需要做一个假设：对于数组中下标为i的节点其左子树和右子树都是保持最大堆性质的堆。在假设成立的前提上，经过这一个维护函数维护过的堆才能够保证是一个最大堆。(There is a hypothesis that the left subtree and the right subtree of the node with the subscr ipt of I in the array are the heaps that maintain the maximum heap properties

/*使用结构体数组，将学生的数据按成绩从高到低排序显示到屏幕上， 将学生中不及格学生的姓名显示出来 写一个函数，获取成绩低于平均分的学生记录并返回低于平均分的学生人数*/(using an array of structures, the student's data is displayed on the screen from high to low, and the student's name is displayed to write a function, to get a stud