Question

只要我看一看,其细致的复杂性就能够作为简单的 lo和精细的复杂性来代表。如何代表部落和原木的复杂性?

感谢!

Answer 1

简单的循环可能具有标志性的复杂性,例如:

for (i = 1; i <= N; i *= 2)
    ...

正如其他人已经回答的那样,一个三重nes的通道将具有立方位的复杂性。

Answer 2

由于立方米是O(n^3),因此是3个nes。

Logarithmic is not so straightforward and usually requires a recursive relation. For example, MergeSort is O(n*log(n)) because it forms a recursion tree of height log(n) and each level requires an O(n) merging operation.

Answer 3

Cubic - three nested loops
Logarithmic - the idea that on each loop cycle you are splitting input data set by parts (or somehow makes it smaller) and in the next cycle process shortened data set, so basically complexity does not growth significantly whilst input data set growth. For instance take a look at the BinarySearch algorithm or any an other Divide and conquer algorithm.

Answer 4

3. 复杂性——三个nes:

foreach
   foreach
      foreach
      // actions
      end
   end
end

Logarithm diversity example - binary search。

Answer 5

O(n^3)有3个nes。

O(log n)由每台自动取款机代表,需要处理的数据数量减少了一半。

友情链接