This paper discusses the parallel merging sorting algorithm for hypercube architecture. Based on the analysis of communication complexity, the speedup of this algorithm is derived.
本文讨论超立方体结构上的并行归并排序算法，着重分析算法的通信复杂性，在此基础上推导算法的加速比。
After analyzing ICA algorithm, a new method of the radar signal sorting based on independent component analysis is proposed.
在深入分析ICA算法的基础上，提出了将其用于雷达信号分选的新思路。
Prepared using the above definition of the heap for sorting algorithms, and analysis of the algorithm is derived time complexity.
编写利用上述定义的堆进行排序的算法，并分析推导算法的时间复杂度。
应用推荐