Compute the recurrence relation, T(n), for the following function, solve it, and give a e bound....

Question

Question

engineering Computer-Science

Answer 1

Answer #1

C1 and C2 are constant time take for operations like comparisons and modulo operations.

we get 2 recurrence relations,one for odd and one for even.

Time taken for even case and odd case is almost same.You can solve any one of the equation to get the upper bound of the function.

Recurrence relation Sm n/ n/ neven As time depends on onlyn: 1 nxam-122 niodd n= 1 Ly Let tome taken beton) The T(A) te La of

Answer 2

Similar Homework Help Questions

Solve the recurrence relation T(n)=T(n1/2)+1 and give a Θ bound. Assume that T (n) is constant for sufficiently small n....

Solve the recurrence relation T(n)=T(n1/2)+1 and give a Θ bound. Assume that T (n) is constant for sufficiently small n. Can you show a verification of the recurrence relation? I've not been able to solve the verification part so far note: n1/2 is square root(n)
Given these methods: METHOD math1: public int math1( int n ) { if (n <= 1) { return 1; } // if...

Given these methods: METHOD math1: public int math1( int n ) { if (n <= 1) { return 1; } // if else { return ( n * 2 ) + math1( n-1 ); } // else } // math1 METHOD math2: public int math2( int n ) { if (n <= 1) { return 1; } // if else { return n + math1( n ) * math2( n/2 ); } // else } // math2 (a) Set up...
Solve the recurrence relation T(n) = 2T(n / 2) + 3n where T(1) = 1 and...

Solve the recurrence relation T(n) = 2T(n / 2) + 3n where T(1) = 1 and k n = 2 for a nonnegative integer k. Your answer should be a precise function of n in closed form. An asymptotic answer is not acceptable. Justify your solution.

Solve the following recurrence relations and give a Θ bound for each of them. (a) T(n)...

Solve the following recurrence relations and give a Θ bound for each of them. (a) T(n) = T(n − 1) + 2n (assume T(0) = 0) (b) T(n) = 2T(n − 1) + c (assume T(0) = 0) (c) T(n) = 2T(n/3) + n (assume T(1) = 1)
For the following recursive function: Derive a recurrence relation, solve the relation, prove the solution is...

For the following recursive function: Derive a recurrence relation, solve the relation, prove the solution is correct, and find its big-O notation. String f2(String s, char c) { if (s.length() == 0) return s; if (s.charAt(0) == c) return f2(s.substring(1), c); else return s.charAt(0) + f2(s.substring(1), c); }
From the code below with Binary Search Tree recurrence T(n)=? use the recursion method and substitution method to solve the recurrence. Find the tightest bound g(n) for T(n) you can for which T(n)= O(...

From the code below with Binary Search Tree recurrence T(n)=? use the recursion method and substitution method to solve the recurrence. Find the tightest bound g(n) for T(n) you can for which T(n)= O(g(n)). Explain your answer and use recursion tree method. void insert(int data) { struct node *tempNode = (struct node*) malloc(sizeof(struct node)); struct node *current; struct node *parent; tempNode->data = data; tempNode->leftChild = NULL; tempNode->rightChild = NULL; //if tree is empty if(root == NULL) { root = tempNode;...

1. Solve the recurrence relation T(n) = 2T(n/2) + n, T(1) = 1 and prove your...

1. Solve the recurrence relation T(n) = 2T(n/2) + n, T(1) = 1 and prove your result is correct by induction. What is the order of growth? 2. I will give you a shortcut for solving recurrence relations like the previous problem called the Master Theorem. Suppose T(n) = aT(n/b) + f(n) where f(n) = Θ(n d ) with d≥0. Then T(n) is: • Θ(n d ) if a < bd • Θ(n d lg n) if a = b...
2.5. Solve the following recurrence relations and give a Θ bound for each of them. (e)...

2.5. Solve the following recurrence relations and give a Θ bound for each of them. (e) T(n) 8T(n/2) n (f) T(n) = 49T(n/25) + n3/2 log n (g) T(n) = T(n-1) + 2 (h) T(n) T(n 1)ne, where c 21 is a constant (i) T(n) = T(n-1) + c", where c > 1 is some constant (j) T(n) = 2T(n-1) + 1 (k) T(n) T(vn) +1
1. Order following function by growth rate: N, √N, N1.5, N log (N), log (log (N)),...

1. Order following function by growth rate: N, √N, N1.5, N log (N), log (log (N)), log (N) log (N), N2, 2N, 200, NN 2. Give a useful Θ (big Theta) estimation for each of following function t(n). a. t(n) = 122 * 212 b. t(n) = 2log2(n2) + log4(n ) + (log2 n) 2 + (log2 (202)) 2 c. t(n) = 3t(n/2) + n d. t(n) = 3t(n/2) + (n+1)(n-1) e. t(n) = 4t(n/2) + (n2 + n-1) f....

3. Determine the asymptotic complexity of the function defined by the recurrence relation. Justify your solution...

3. Determine the asymptotic complexity of the function defined by the recurrence relation. Justify your solution using expansion/substitution and upper and/or lower bounds, when necessary. You may not use the Master Theorem as justification of your answer. Simplify and express your answer as O(n*) or O(nk log2 n) whenever possible. If the algorithm is exponential just give exponential lower bounds c) T(n) T(n-4) cn, T(0) c' d) T(n) 3T(n/3) c, T() c' e) T(n) T(n-1)T(n-4)clog2n, T(0) c' 3. Determine the...