资源列表
Josephus-problem
- 设编号为1-n的n(n>0)个人按顺时针方向围成一圈．首先第1个人从1开始顺时针报数，报m的人(m 为正整数)．令其出列。然后再从他的下一个人开始，重新从1顺时针报数，报m的人，再令其出列。如此下去，直到圈中所有人出列为止。求出列编号序列。-Numbered 1-n set of n (n> 0) Personal clockwise circle. First Person 1 1 clockwise report the number of people reported to
Binary-Tree-Traversal
- 本程序的功能是利用二叉树后序遍历来实现表达式的转换，同时可以使用栈来求解 后缀表达式的值。-The function of this program is to be implemented after preorder binary tree transform expression, and can use the stack to solve value postfix expression.
GraphBook.latest-r1991
- The Graph Book. Everything you need to knwo about graphs and how to effectively use them to solve problems.
Radix-Sort
- 基数排序是一种非比较型整数排序算法，其原理是将整数按位数切割成不同的数字，然后按每个位数分别比较。- Radix sort is a kind of non comparative sorting algorithm, which is based on the number of integers into different numbers, and then according to the number of each.
Bucket-Sort
- 桶排序也叫箱排序。工作的原理是将数组分到有限数量的桶子里，每个桶子再个别排序（有可能再使用别的排序算法或是以递归方式继续使用桶排序进行排序）。- Bucket sort is also called sorting box. Work principle is that the array to a limited number of bucket, each bucket and individual ranking (may use other sorting algorithms
Bubble-Sort
- 冒泡排序是一种极其简单的排序算法，也是我所学的第一个排序算法。它重复地走访过要排序的元素，一次比较相邻两个元素，如果他们的顺序错误就把他们调换过来，直到没有元素再需要交换，排序完成。-Bubble sort is a simple sorting algorithm, sorting algorithm is first learned by me. It repeatedly visited to sort the elements, a comparison of the two adjac
Selection-Sort
- 选择排序也是一种简单直观的排序算法。它的工作原理很容易理解：首先在未排序序列中找到最小（大）元素，存放到排序序列的起始位置；然后，再从剩余未排序元素中继续寻找最小（大）元素，放到已排序序列的末尾。以此类推，直到所有元素均排序完毕。-Selection sort is a simple and intuitive sort algorithm. Its working principle is easy to understand: first in the unsorted sequence t
Insertion-Sort
- 插入排序在实现上，通常采用in-place排序（即只需用到O(1)的额外空间的排序），因而在从后向前扫描过程中，需要反复把已排序元素逐步向后挪位，为最新元素提供插入空间。- Insertion sort in the implementation, is usually used in place sorting (i.e., only need to sort of O (1) extra space). Therefore in the forward scan process a
C
- C语言实现的数据结构中二叉树的前序遍历、中序遍历和后序遍历以及几种排序算法-C language data structure binary tree before preorder, preorder and postorder and several sorting algorithm
main
- 求最长上升\下降\非上升\非下降的刷表法-Seeking maximum rise \ fall \ Philippines rise \ fall Philippines brush table method
binarysorttree
- 输入一组记录构造一棵二叉排序树，并且输出这棵二叉排序树的中序序列 给定一个关键字值，对所构造的二叉排序树进行查找，并输出查找的结果。 -Enter a group of records a binary sort tree structure, sequence and output sequence tree binary sort tree Given a key value of the constructed binary sort tree search, and ou
look-uptable
- 按关键字从小到大顺序输入一组记录构造查找表，并且输出该查找表； 给定一个关键字值，对所构造的查找表分别进行顺序查找和折半查找，输出查找的结果以及查找过程中“比较”操作的执行次数。 -Press the key sequence input small to large lookup table constructed a set of records, and the output of the look-up table Given a key value of the con