20070320list

floyd算法 数据结构 求最短路径(floyd algorithm for data structure for shortest path)

使用C语言建立带头结点链表实现了集合。并进行了性能上的优化。(Achieve set using C to build list witch head node. And make optimization in performance.)

已知线性表中的元素以值递增有序排列，并以单链表作存储结构。试写一高效的算法，删除表中所有值大于mink且小于maxk的元素（若表中存在这样的元素）同时释放被删结点空间，并分析你的算法的时间复杂度（注意：mink和maxk是给定的两个参变量，它们的值可以和表中的元素相同，也可以不同）。(Known linear elements in the table to the value increments ordered, and a single list for the storage structure. Try to write a highly efficient algorithm to delete all values ​ ​ greater than mink and maxk elements smaller than (if there is such an element in the table) while the release of the deleted node space, and analyze your time complexity of the algorithm (Note: mink and maxk is given two parameters variables, their values ​ ​ and elements in the table can be the same or different).)

哈夫曼树可以使读者快速方便的查找所需文件(Huffman tree allows readers to quickly and easily find the file)

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

这是我在学习数据结构做练习时写的一个小程序，功能是在命令行下进行形如：23+34*3/4+(3*6+10)的四则运算，支持+,-,*,/,(,)进行整数运算。(This is a simple code about data structure.It uses to carry on four arithmetic operations with parenthesis.But now it only supports integer.)

用C语言实现的普通快速排序，和随机快速排序进行对比(With ordinary C language implementation of quick sort, quick sort and compare the random)

数据结构学习中提供的不错的源码，一个哈夫曼树类，利用了链队列存储结构。压缩包中有七个文件。(Data structure provided a good learning source, a Huffman tree class, the use of the chain queue storage structure. There are seven compressed file.)

算法导论的英文版，讲解算法的非常经典的书。(English version of Introduction to Algorithm. A classical book to teach algorithm.)

用于课程设计 利用Dijkstra算法进行简单的最短路径查询 (For curriculum design simple shortest path query)