搜索资源列表
-
0下载：
按时org,开放的网络天书! 基数排序是这样实现的: 假设需排序数列的取值...如果化成比较树可以知道,这样的排序算法复杂度的下限是O(N*lnN),而基数排序没有比较元素,所以所需排序时间就少了,我们...
www.cnic.org/wiki/鍩烘暟鎺掑-time org, open network hieroglyphics! Sort base is achieved : a few assumptions need to sort out ... If the value into
-
-
0下载：
1． 用任何一种高级开发语言编程实现矩阵相乘的Strassen算法。
2． 分析其时间复杂度。
3． Strassen算法与传统算法其优点与不足之处。
-1. Any development of a high-language programming matrix multiplication, the algorithm Strassen. 2. Analysis of their time complexity. 3. Strassen algorithm and the tr
-
-
0下载：
设计算法实现在一个具有在n各互不相同元素的数组A[1…n]中找出所有前k个最小元素的问题，这里k不是常量，即它是输入数据的一部分。要求算法的时间复杂性为Θ(n)。-design of the algorithm is in a n incompatible with the elements of the array A [1 ... n] to identify all former k smallest elements of the problem, here k is not const
-
-
0下载：
排序算法，各种排序算法的实现和时空复杂度比较,比如快排，选择排序，冒泡，堆排，希尔排序-Scheduling algorithm, the realization of a variety of sorting algorithm and space complexity comparison，For example, fast scheduling, selection sort, bubble sort, heap row,shell sort......
-
-
0下载：
Computation Method D phononic bandgap plane wave, Algorithm for researchers to do reference, LZ complexity is reflected in a time sequence.
-
