搜索资源列表
yuanma
- 1.大型稀疏线性方程组的求解 A*X=b 。 2. 一维数组冒泡法排序算法 4.矩阵求逆 5. 改进的牛顿算法——弦割法 -1. Large sparse linear equations, the solution X = A * b. 2. One-dimensional array Bubble Act Sorting Algorithm 4. 5 matrix inversion. Improved Newton's algorithm -- S
kth_smallest
- Kth Largest element in an array in time O(n) without sorting the entire array.
Bubble_S5
- The "binary search algorithm" is one of the quickest way for searching threw an array, the "linear search algorithm" makes "n" comparaisons for searching for an element inside a given array. The "binary search algorithm" only makes log2(n) comparaiso
Level_B
- 编制一维数组排序程序。数组大小n用全局变量定义，数组数据从文本文件中读入或随机生成。包含冒泡排序、选择排序、插入排序三种排序方法。程序能够选择使用任何一种方法排序。-The preparation of one-dimensional array sorting program. Array size n with the global variable definition, an array of data read from a text file or randomly generate
Avl_tree
- Program sorting array of numbers using avl tr-Program sorting array of numbers using avl tree
quanpailie
- 通过字典排序法生成全排列 并对其进行检验，对全向置换进行计数-Sorting through the dictionary and its full array generated test on all counts to the replacement
Countingsort
- Counting sort (ultra sort or math sort[1]) is a sorting algorithm which (like bucket sort) takes advantage of knowing the range of the numbers in the array to be sorted (array A). It uses this range to create an array C of this length.
Bucket_Sort
- Bucket sort, or bin sort, is a sorting algorithm that works by partitioning an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorith
sleep_algorithm
- 这是睡眠排序算法的Go语言版，该算法是一个天才程序员发明的，想法很简单，就是针对数组里的不同的数开多个线程，每个线程根据数的大小睡眠，自然睡的时间越长的，数越大-This is the sleep the Go language version of the sorting algorithm, the algorithm is a genius programmer invention, the idea is simple, it is a different number for the
BWT_Compre1508411252002
- Compression using Burrows Wheeler Transform. Includes n*log(n) comparison tri-partite suffix array block sorting, Move-to-Front coding, dynamic canonical Huffman coding of Wheeler s run-length-coding.
kuaisupaixu
- 采用快速排序算法的思想，对一个数组的元素进行从小到大的排序。-Fast sorting algorithm uses the idea of the elements of an array small to large order.
Dijkstra
- Heaps where the parent key is greater than or equal to (≥) the child keys are called max-heaps those where it is less than or equal to (≤) are called min-heaps. Efficient (logarithmic time) algorithms are known for the two operations needed to implem