搜索资源列表
SPIHT
- 通过调整小波系数的排序过程，用一维数组代替原有的链表结构，改变小波系数的重要性判断依据等措施对原有的SPIHT算法进行改进。-By adjusting the wavelet coefficients of the sorting process, using one-dimensional array instead of the original list structure, the importance of changing the wavelet coefficients and o
code1
- 键盘任意输入一组字母或数字生成无序数组，对数组按ASCII顺序进行排序（排序要求至少用两种排序算法），再从键盘输入一个值进行二分查找，返回查找成功或者失败的信息-Keyboard input and a group of letters, or any number of arrays, and generate disordered array sort order according to the ASCII at least two requirements (sort of), sor
VC
- 求整数n的各位数字之和，并判断n是几位数，以及判断是否为素数，求最大公约数，求阶乘，多种排序方法，以及数组转置的方法-Digits and integer n and n and determine the numbers that judgment is a prime number, and the greatest common divisor, factorial, and a variety of sorting methods, as well as the array transp
mergesort
- This code does a good sorting one a given array of n numbers. It uses the concept of divide and conquer paradigm which calculates the sorted array in O(nlogn) time which is the most efficient order for sorting numbers
Sequence
- 数组的排序各种排序方法 以及排序的时间计算-Array sorting various sorting methods, and the calculation of time sorting
merge-sort
- merge sort. sorting elemnts of an array using merge sort algorithm