本帖最后由 WWCZHC 于 2015-3-3 12:36 编辑
When trying to characterize an algorithm’s efficiency in terms of execution time, independent of any particular program or computer, it is important to quantify the number of operations or steps that the algorithm will require. If each of these steps is considered to be a basic unit of computation, then the execution time for an algorithm can be expressed as the number of steps required to solve the problem. Deciding on an appropriate basic unit of computation can be a complicated problem and will depend on how the algorithm is implemented.
当试图在执行时间来表征的算法的效率,独立于任何特定的程序或计算机的,量化的操作或步骤,该算法将需要的数量是很重要的。如果每个步骤被认为是计算的基本单元,则执行时间的算法可表示为解决这一问题所需要的步骤数。决定计算的适当的基本单元可以是一个复杂的问题,并且将取决于该算法是如何实现的。
谁能和我说说 Big-O Notation(大O定理)是什么...... |