algorithm complexity

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）。

The algorithm complexity is.

算法的复杂度为.

Algorithm complexity of two& way polyphase merge external sort

二路多步归并外分类的算法复杂度

If we are to raise compression speed, then the algorithm complexity must increase.

如果要提高压缩速度, 那么算法的复杂度就得增加了.

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）。最后对空间约束条件的处理采用了嵌入约束边的方法。

Finally, the algorithm complexity has also been analyzed in detail.

分析了算法的存储与计算复杂度。

The hardware cost of this network is O ( NlogN). and the time complexity of this multicast algorithm is O ( N).

此类的网络的硬件代价为O（NlogN），此多源点多播路由算法的时间复杂度为O（N）

May be your problem falls into a infinite loop or you should reduce your algorithm complexity.

可能是您的程序陷入了死循环或者您需要改进您的算法复杂度.

The problems such as the algorithm complexity and the sampling period are also discussed.

并讨论了这些算法的时间复杂度，采样周期等问题。

Comparing with artificial participation, algorithm complexity can obviously accelerate the processing speed.

相对于人工参与量，算法复杂度的降低能显著加速处理进程。

The algorithm can decompose a complex planar polygon with nesting holes, and its time complexity is O ( nlogn) by analysis and testing.

该算法能够分解内嵌多个环的复杂多边形，分析及测试表明，其时间复杂度为O（nlogn）。

The binary searching algorithm based on comparison have the complexity of O ( NlogN).

处理汉字的以比较为基础的二分查找算法，其复杂性为O（NlogN）。