Home > Mobile >  does the constant in calculating time complexity have to be a integer number?
does the constant in calculating time complexity have to be a integer number?

Time:12-15

suppose f(n) = O(g(n)) then we say that 0 <= f(n) <= cg(n) .

my question is does this 'c' have to be a integer . not only for big-O notation but for all other notations like omega and theta notation?

i want to solve the question n! = w(2^n) based upon that since the expression comes out to be n! = c1*2^n. now i have to calculate c1 and n0>=n for that.

CodePudding user response:

NO , it does not have a integer . it can be any positive real number and it also be in fraction also.

  • Related