Thread: Can an algorithm be Theta but not Big-O or Omega?

i'm not sure if there's better sub-forum put question in.

new computer science , programming in general, , learned big-o, omega, , theta, think have decent grasp on them (though i'd happy proved wrong too). understand algorithm can big o , omega, not theta. example if o(n) , omega(1), there no theta.

however, ran being claimed function theta(1), not big o or omega. make sense? theta means there 2 constant factors multiply function, 1 factor gives upper bound function , other 1 factor gives lower bound function. right?

big o means there constant factor give upper bound (already established above 1 of two).

omega means there constant factor give lower bound (already established above 1 of two).

in essence seems saying thing both , b, neither nor b. logically doesn't make sense... if theta seems me has both big o , omega (though opposite not true).

welcome thoughts of more experienced in these matters.

posted the111

if theta seems me has both big o , omega (though opposite not true).

that think.

Forum The Ubuntu Forum Community Ubuntu Specialised Support Development & Programming Programming Talk Can an algorithm be Theta but not Big-O or Omega?

Ubuntu