I'm studying the master method to solving a recurrence. It describes three cases, the last one of which depends on what lower bound a function f(n)
has.
I usually find out the upper bound of a function from its highest term exponent. How would I figure out its lower bound Ω
?
c
that multiply a functiong()
that determines the complexity. Is the function always the same and different constants will give us the lower and upper bounds?... Thanks... $\endgroup$ – Vagabond Mar 26 '18 at 12:22