fibonacci-heap

各种排序算法的实现，如快速排序，冒泡排序，选择排序，堆排序，二分插入排序等(Implementation of various sorting algorithms, such as quick sort, bubble sort, selection sort, heap sort, binary insertion sort, etc.)

设有一头指针为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.)

实验内容： 建立一个包含图书（书号，书名，定价）信息的的链表，并具有如下功能： (1) 根据指定图书个数，逐个输入图书信息； (2) 根据书名进行查找，返回此书的书号和定价； (3) 根据指定的位置可返回相应的图书信息（书号，书名，定价）； (4) 给定一个图书信息，插入到表中指定的位置； (5) 删除指定位置的图书记录； (6) 统计表中图书个数。 (It is a good c++.)

本程序是用c语言编写的在800位整数之间的乘积运算(This procedure is written in c the 800 integers in the product operation between)

单链表逆置的源码~提供了源码和源码说明~简单实用，适用于课堂作业程度(Reverse single linked list provides a set of source code source code and source code ~ ~ simple and practical instructions for classroom work degree)

说明：  动态规划是用空间换时间的一种方法的抽象。(Dynamic programming is to use space in time a method of abstract.)

输入N个点的坐标，判断这N个点能否构成一个凸多边形。(Enter the coordinates of N points, to determine whether the N points form a convex polygon.)

说明：  链表逆转,实现单链表的逆转程序，数据结构(List Inverse)

效验算法单循环链表，这些都是实用经典的算法和数据结构(Well-tested algorithm round robin list, these are practical classic algorithms and data structures)

利用二叉平衡树进行数据排序。这里采用的数据结构是指针。(The use of balanced binary tree sort the data. The data structure used here is a pointer.)