seven11

Hi I'm studying for an exam and need to know if i'm correct here pls. [B]Q1.[/B] Give reverse polish of expressions [B]a+(b+c)*(d-e)[/B] [B]A:[/B] a b c + d e - * + [B]Q2[/B]. Give the normal of reverse polish form [B]a b c d + * -[/B] [B]A: [/B] a …

I'm studying for an exam and need to see if my answers for the following question is correct. Give the bigO estimate for each code fragment in terms on n. method L has method signature void L(int n) & has execution time complexity of O(n). method C has method signature …

I need help in determining,using Big-O notation, the upper-bound for these two algorithms i wrote. They both do the same thing but are coded differently. They both look for all the prime numbers up to some limit, N. This first algorithm: [CODE] public static void algo1(){ primes = new int[n]; …