Dear Maths Help here are my questions: I am desperate could you help, this is discrete maths which relates to computing uni math. My homework is due on 30 April 2007 morning. Hope you can help me. I have tried all avenue.
show that if (n)=O(n2),g(n)=O(n3) that f(n)+g(n)=O(n3)
Please note that the email does not let me do the superscript.
all the (n2) and (n3) the figure 2 and 3 are in superscript. Refer to attachment on the two question as well which is in superscript for question 1 and for question 2 - appropriate symbols for theta.
Find the theta notation for the number of executions of the operations x=x+1in the code below
for i = 1 to n
for j = 1 to j
for k = 1 to i
answer given is (H) (n^3)
From Unisa at: firstname.lastname@example.org
Thanks look forward to hear from you before 30/4/07