A program's main function consists of two function calls to f and g, in sequence. The asymptotic time complexity of f is, f(n) - Big-Theta(n logbase2 n). The asymptotic time complexity of g is g(n) = Big-Theta(n). What is the overall time complexity of the program?
I agree with Alvaro. If any member directly gave you the correct answer to your question, what do you benefit? I mean,how are you gonna get the answer to the next question? or -more importantly-, how are you gonna pass the exam?
However, even if you disagree, these are the rules of this forum, don't take it personally...
Alvaro wrote:Now you just have to work on your attitude.
Maybe not. After all, that is how the real world works: one person reads off the questions, while his colleagues solve them: This is what problem solving in a professional team environment is all about. Then everyone gets credit and equal accolades and salaries and a big star by their name in the break room for doing such a good job.