The problem involves proving that the function f(n) = n * log(n) is O(n(1+sqrt(n))). This falls within the subject area of algorithm analysis and asymptotic notation.
The discussion is ongoing, with participants sharing their understanding of the definitions and expressing confusion about the relationship between f(n) and g(n). Some guidance has been offered regarding solving for constants, but no consensus has been reached on the approach to take.
Participants note a lack of clarity on how to manipulate f(n) to fit the form of g(n) and express uncertainty about the origin of certain terms in the inequality.
Well, you were given an f(n) and asked to proveLogik said:f(n) is O(g(n)) if and only if there exists an n_0 part of natural numbers and a constant C that is part of rational numbers for which f(n) <= that c*g(n) for all n >= n_o
I know the def just don't know how to get g(n)...
I think I had misunderstood you -- your last post sounded like you said you didn't know what g(n) was.Logik said:yes well I don't know how to go from f(n) to g(n)... the examples I have seen were just that you would multiply so part of f(n) until you could group everything together to get c* g(n) but this time I don't see how I can multiply anything to get anything that looks like g(n)...
Logik said:I don't know where to start to solve for c.. that is my problem...