搜索资源列表
递归算法快速排序
- 分而治之方法还可以用于实现另一种完全不同的排序方法，这种排序法称为快速排序（quick sort）。在这种方法中， n 个元素被分成三段（组）：左段l e f t，右段r i g h t和中段m i d d l e。中段仅包含一个元素。左段中各元素都小于等于中段元素，右段中各元素都大于等于中段元素。因此l e f t和r i g h t中的元素可以独立排序，并且不必对l e f t和r i g h t的排序结果进行合并。m i d d l e中的元素被称为支点( p i v o t )。图1 4
DataStrucure
- 这是我上数据结构和算法课程是老师的课件 所有算法都用c++实现拉 .比用伪代码描叙要 好得多-on data structures and algorithms is the teacher's curriculum courseware all algorithms are used to achieve c Rafah. Pseudo code than depicts much better
bak
- 数据结构中链表算法的PPT，包括伪代码和基本原理，内容很详细-Data structure linked list algorithm PPT, including pseudo-code and the basic principles of the content in detail
-p2
- 最长公共子序列（LCS），最长递增子序列（LIS），最长公共递增子序列（LCIS）的实现，根据《算法导论》英文版的伪代码改写成C语言版本，测试完美通过。-The longest common sub-sequence (LCS), the longest increasing subsequence (LIS), the longest sequence of public increments (LCIS) of the realization, according to " Intr
diguisuanfa
- 递归算法的实验报告，内有递归算法的伪代码及C语言实现，以及部分实例~-Experimental report recursive algorithm, recursive algorithm, there are pseudo-code and C language, as well as some examples ~
huffmancode
- 有关huffman编码的具体实现的源代码，算法参考严蔚敏版算法课本的huffmancode伪代码，供初学者参考-Concrete realization of the huffman encoding the source code, algorithm reference Yan Wei-min version of the textbooks huffmancode algorithm pseudo-code for beginners reference
code
- (1) 生成n个[0,65535]以内的整数随机数，存入文本文件； (2) 将n个随机数从小到大排序，并显示结果。排序采用k桶法 (3)用函数编制混合同余的伪随机数发生器-(1) generate n-[0,65535] integer random number within, into a text file (2) n random numbers from small to large order, and displays the results. Sort by k B
Astart
- A*算法资料，包括算法原理，算法剖析，伪代码，还有一些研究文献。 图像处理方面涉及全局最优最短路径会相当有用-A* algorithm information, including algorithm theory, algorithm analysis, pseudo code, and some literature. Image processing involves the global optimal shortest path will be very useful for
c
- 配套书籍的源代码，将数据结构清华那版书上的伪代码翻译-Complete book' s source code, the data structure that version of the book Tsinghua pseudo-code translation
2
- 你是否为数据结构一书中的伪代码而烦恼呢 不愁 这个逆序建立链表的C语言源代码能给你帮助-Are you a book for the data structure of the pseudo-code to worry about what to worry about the reverse order to establish the list of C language source code can give you help
90253940whiteblackpoint
- 给出你设计的求解下面问题算法的伪代码并分析复杂性：设B={b1,b2, ,bn} 和 W={w1,w2, ,wn}为平面上黑点和白点的两个集合。一个黑点bi=(xi, yi )与一个白点wj=(xj, yj ) 匹配当且仅当xi≥xj 和yi≥yj 。设计一个贪心算法，找出黑白点之间的最大匹配数目。算法的复杂性要尽量接近nlgn. -Give your algorithm designed to solve the following pseudo code and the problem of
AVLTreeStudy
- 该资源是对于AVL树学习的资料，包含插入和删除操作的伪代码，与《数据结构》书中的代码相对应。属于本人原创。-The AVL tree learning resource for information, including the insertion and deletion of the pseudo code, and " data structure" corresponding to the code book. I belong to the original.
bstree
- 二叉查找树的简单实现，插入，删除，算法导论上伪代码的实现-Simple implementation of a binary search tree, insert, delete, Introduction to Algorithms on the realization of the pseudo-code
QuickSort
- 经典快速排序算法，适合初学者理解学习，基于《算法导论》中快排的伪代码实现的-The classic Quicksort algorithm suitable for beginners to understand, based on the pseudo-code in Introduction to Algorithms.
4
- 初学数据结构的人，面对一个个算法，一个个伪代码，不知道如何入手，本程序是一个参考源码，有助于初学者快速入门-Beginners data structure, in the face of each algorithm, a pseudo code, don t know how to start, this program is a reference source, help beginners quickstart
quicksort
- 《算法导论》第三版中快速排序伪码的C语言实现-"Introduction to Algorithms" the third edition of Quick Sort pseudo-code in C language
radixsort
- 《算法导论》第三版中基数排序伪码的C语言实现-"Introduction to Algorithms" third edition radix sort pseudo-code in C language
countingsort
- 《算法导论》第三版中计数排序伪码的C语言实现-"Introduction to Algorithms" third edition counting sort pseudo-code in C language
heapsort
- 《算法导论》第三版中堆排序伪码的C语言实现-"Introduction to Algorithms" third edition heap sort pseudo-code in C language
insertsort
- 《算法导论》第三版中插入排序伪码的C语言实现-"Introduction to Algorithms" the third edition of insertion sort pseudo-code in C language