我在寻找一个标准的方法来确定一个程序的运行时间复杂度为。
I am searching for a standard way to identify running time complexity of a program.
它将从预定的有效命令行选项列表和时间复杂度为O(1)的查找函数中生成一个散列表。
It generates a hash table from the predetermined list of valid command-line options and a lookup function whose time complexity is o (1).
代码量挺少，不过数据较大的时候需要时间比较长，时间复杂度为On ！
Code volume quite low, but when the need for greater data a longer period of time complexity is o n!
为了解决这个问题，本文提出一种新的模式合一算法，共时间复杂度为线性的。
To solve the problem, this paper proposes a new pattern unification algorithm, which time complexity is linear.
IsValidCommandLineOption的查找时间复杂度为o (1)。
IsValidCommandLineOption has a lookup time complexity of o (1).
该算法的时间复杂度为O (N)，且附加存储空间极小，特别适合于数据量大的场合。
Its time complexity is o (n), and its appended storage space is very small. The algorithm particularly suits to the situation of large amounts of data.
经过在数据结构和实现方式上的改进，算法总体平均时间复杂度为O（NlogN）。
With the improvements in the data structure and realization, the algorithm took O(NlogN)time, where N is the input size.
通常情况下，该算法的时间复杂度为O (n)，而这样的时间复杂度不能很好地满足实时系统的要求。
Normally, this algorithm's time complexity is o (n), so it can't satisfy real-time well.
理论分析表明，整个网络执行该方案的时间复杂度为节点规模的平方阶，说明方案具有较强的可用性与可伸缩性。
According to the theoretical analysis, the time complexity of the computation operated by the whole network is the square of the size of node.
重要的是，算法保证在一系列的操作之后，耗时昂贵的操作时间被分摊，从而使整改操作的时间复杂度为O（1）。
What is important is that the algorithm guarantees that after a sequence of operations the expensive operations will be amortised and thereby rendering the entire operation O(1).
perfectproperty：查找时间复杂度为o(1)的表条目—就是说，至多需要一个字符串比较执行静态搜索集中的关键字识别。
Perfect property: Locating a table entry requires o (1) time-that is, at most, one string comparison is required to perform keyword recognition within the static search set.
为迅速地检索到与当前异常情况最匹配的处理规则，设计了时间复杂度较低的异常处理规则检索算法。
For finding the most similar exception handling rule from exception rule base, the searching algorithm with low time complexity was designed.
在此基础上，以整数规划算法为数学工具给出了时间算法复杂度为多项式的最优基本信标的计算方法。
Furthermore, the integer programming method is exploited as the mathematical tool for the generation of a polynomial algorithm producing the optimal set elementary siphons.
以问题空间上启发值的分布为启发函数的特征来分析迭代延伸A* （IDA~** ）的时间复杂度，使启发函数的作用相当于减小有效的搜索深度。
The running time of iterative-deepening-A~*(IDA~*) algorithm is analyzed with heuristic function of the problem space and the effect of the function is to reduce the actual search depth.
以问题空间上启发值的分布为启发函数的特征来分析迭代延伸A* （IDA~** ）的时间复杂度，使启发函数的作用相当于减小有效的搜索深度。
The running time of iterative-deepening-A~*(IDA~*) algorithm is analyzed with heuristic function of the problem space and the effect of the function is to reduce the actual search depth.
应用推荐