[英]In asymptotic notation why we not use all possible function to describe growth rate of our function?
if f(n) = 3n + 8,如果 f(n) = 3n + 8,
for this we say or prove that f(n) = Ω(n)为此我们说或证明 f(n) = Ω(n)
Why we not use Ω(1) or Ω(logn) or.... for describing growth rate of our function?为什么我们不使用 Ω(1) 或 Ω(logn) 或.... 来描述我们的 function 的增长率?
In the context of studying the complexity of algorithms, the Ω asymptotic bound can serve at least two purposes:在研究算法复杂性的背景下,Ω 渐近界至少可以用于两个目的:
check if there is any chance of finding an algorithm with an acceptable complexity;检查是否有机会找到具有可接受复杂度的算法;
check if we have found an optimal algorithm, ie such that its O bound matches the known Ω bound.检查我们是否找到了最优算法,即它的 O 界与已知的 Ω 界相匹配。
For theses purposes, a tight bound is preferable (mandatory).出于这些目的,严格的界限是可取的(强制性的)。
Also note that f(n)=Ω(n) implies f(n)=Ω(log(n)), f(n)=Ω(1) and all lower growth rates, and we needn't repeat that.另请注意,f(n)=Ω(n) 意味着 f(n)=Ω(log(n))、f(n)=Ω(1) 和所有较低的增长率,我们无需重复。
You can actually do that.你实际上可以这样做。 Check the Big Omega notationhere and let's take
Ω(log n)
as an example.在这里查看 Big Omega 符号,我们以
Ω(log n)
为例。 We have:我们有:
f(n) = 3n + 8 = Ω(log n)
because:因为:
(according to the 1914 Hardy-Littlewood definition) (根据 1914 年 Hardy-Littlewood 定义)
or:或者:
(according to the Knuth definition). (根据 Knuth 定义)。
For the definition of liminf
and limsup
symbols (with pictures) please check here .有关
liminf
和limsup
符号的定义(带图片),请查看此处。
Perhaps what was really meant is Θ
(Big Theta), that is, both O()
and Ω()
simultaneously.也许真正的意思是
Θ
(Big Theta),即O()
和Ω()
同时。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.