algorithm - Help with big O notation -
I am trying to understand the concept of big o notation. So, according to the definition, the large o is as follows, T (n) ∈ o (g), if t (n) = G (n) * C
.
Since continuous "C" can be any integer> 0, will not the following example also be true?
Example:
N log n ∈ o (log n) n log n & lt; = Log n * c
where the value of cn is equal to.
I know the answer is that n log n ∉ O (log n)
but I do not know if anyone can be stable since C. Thanks in advance for your help: D
There is only one, a < Em> Stable This means that you can not say "value of n" because you have to select something first and then allow the comparison to be captured for everyone.
In other words, to be some T (n) o (g) in order, not must be continuously present such as g (n) * c All N is bigger than T (N).
This is not log n o (log n), because no matter how many continuous you choose, n> c to n log n must be greater than c log n.
Comments
Post a Comment