英语单词nlogn是什么意思?nlogn怎么读?nlogn怎么发音?英语网为您整理了nlogn的解释、用法、例句、词组等相关学习资料。下面跟小编一起来看看吧！
nlogn的意思
1、时间复杂度；堆排序
nlogn的双语例句
1、The time complexity of this algorithm is equal to O ( nlogn+ n [ d/ 2]), if an auxiliary data structure called Delaunay Tree is used in it.
如果采用一种称为Delaunay树的数据结构来辅助点的定位，则算法的效率为O（nlogn+n[d/2]）。
2、And this strategy can make the computational complexity less than O ( nlogn).
这种策略使这种新算法的总的计算复杂度将到了O（nlogn）以内。
3、The binary searching algorithm based on comparison have the complexity of O ( NlogN).
处理汉字的以比较为基础的二分查找算法，其复杂性为O（NlogN）。
4、An O ( nlogn) Algorithm for the Shortest Paths between Two Set of Points in the Plane
平面上两个点集间距离的O（nlogn）算法
5、The traditional sorting and searching algorithms based on comparison have the complexity of O ( NlogN).
处理汉字的传统的排序和查找算法，其复杂性为O（NlogN）。
6、This is obviously superior to the currently popular sorting algorithms whose time cost is O ( nlogn).
明显优于现行o（nlogn）算法。
7、The hardware cost of this network is O ( NlogN). and the time complexity of this multicast algorithm is O ( N).
此类的网络的硬件代价为O（NlogN），此多源点多播路由算法的时间复杂度为O（N）
8、It is proved that the time complexity of the algorithm is 0 ( AT) in general and O ( NlogN) at worst cases.
推导证明了综合算法在一般情况下的时间复杂度为O（N），最坏情况下的时间复杂度为O（NlogN）。
9、Its time-complexity, in theory, is O ( nlogn).
算法达到了O（nlogn）的理论时间复杂度下限。
10、The algorithm can decompose a complex planar polygon with nesting holes, and its time complexity is O ( nlogn) by analysis and testing.
该算法能够分解内嵌多个环的复杂多边形，分析及测试表明，其时间复杂度为O（nlogn）。
11、Relying on the theorem of Graham, the sample points are realized the minimal convex hull which computational complexity is O ( NlogN).
根据凸包生成算法原理，用Graham算法实现散乱样本的最小凸包，算法复杂度为O（NlogN）。
12、By analysis, The time s complexity of this algorithm is O ( nlogn). Finally, inserting constrained edge is used to Expresses Delaunay Triangulation in the constrained data field.
经分析，整个算法的时间复杂度为O（nlogn）。最后对空间约束条件的处理采用了嵌入约束边的方法。
13、By means of divide and conquer, the problem has been solved from the point of linearity and space, furthermore, it can be accomplished within the O ( nlogn).
利用分治法已经解决该问题的一维和二维情况，且算法都可以在O（nlogn）时间内完成。
14、We present a parallel and no-backtrack heuristic algorithm to solve "time tabling problem". The algorithm can find a feasible timetable in O ( nlogn) time under given constrained conditions.
给出一种并行无回溯的解时间表问题的启发式算法，它能在O（nlogn）时间内找到一种满足给定的约束条件的可行时间表，如果这种时间表确实存在的话。
15、Presents an algorithm for determining the convex hull of a finite set of points in a plane. The algorithm requires O ( n) multi-plications and O ( nlogn) comparisons.
提出了一种求平面有限点集凸壳顶点的算法，并分析出该算法的时间复杂性是线性次乘法和O（nlogn）次两个数的比较。
16、After investigating the essential characteristics of the Hilbert curve, this paper puts forward a new Hilbert coding algorithm with a complexity of O ( nlogn) based on partitioning, and analyses the algorithm with practical instances.
通过对Hilbert曲线基本特征的研究，本文提出了一种新的基于分划的Hilbert编码方法，新算法的时间复杂度为O（nlogn），本文最后通过实例对算法进行了分析。
17、The average running time of quick sort is less than that of all other currently known 0 ( nlogn) sorting algorithms. Its average time is O ( nlogn), and its performance is O ( n~ 2) in the worst case.
快速排序算法的平均时间小于所有已知的O（nlogn）排序算法。
18、TSM-FMM reduces computational complexity to o ( NlogN) for sparse structures and to o ( N) for dense structures, from o ( N3) for the Gaussian elimination method and o ( N2) per iteration for the CG method.
运用这种方法，能把计算复杂度从高斯消元法的o（N~3）和CG法的o（N~2）减少到：对于稀疏结构的o（NlogN），对于稠密结构的o（N）；
以上是英语网为您整理的nlogn怎么读的相关信息，希望对大家有一定的帮助。查看更多关于nlogn的用法、nlogn的释义、nlogn的相关详情请点击：https://dict.ruihongw.com/nlogn
