(a) Write a linear time ( 6(n) ) divide and conquer algorithm to calculate x", that is x is raised to the power n. Assume x and n are both >=0. (b) Analyze the time complexity of your algorithm in the worst-case by first writing its recurrence relation. (c) Can you improve your algorithm in Part a to accomplish the result in O(log n) time complexity (we still look for a divide and conquer algorithm). If yes, write the corresponding algorithm, write the recurrence relation for its time complexity and analyze it. If no, justify your answer.

(a) Write a linear time ( 6(n) ) divide and conquer algorithm to calculate x", that is x is raised to the power n. Assume x and n are both >=0. (b) Analyze the time complexity of your algorithm in the worst-case by first writing its recurrence relation. (c) Can you improve your algorithm in Part a to accomplish the result in O(log n) time complexity (we still look for a divide and conquer algorithm). If yes, write the corresponding algorithm, write the recurrence relation for its time complexity and analyze it. If no, justify your answer.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Prove by induction that, if T(n) ≤T(5n/6) + O(n), then T(n) = O(n). Assume the base case isconstant, i.e., that T(n) = Θ(1) for all n≤cfor some constant c. Then, prove this result againusing the DC Recurrence Theorem
Please help me solve Part A of this problem
Explain why the Gale-Shapley Algorithm lasts at most n rounds, with at most n^2 total proposals. Also explain why the algorithm must eventually terminate, with every resident and every hospital getting matched.
Consider the following MAXMIN algorithm. How many comparisons does it use? Is it likely to be faster or slower than the divide-and-conquer algorithmin practice? procedure maxmin2(S) comment computes maximum and minimum of S[1..n] in max and min resp. 1. if n is odd then max:=S[n]; min:=S[n] 2. else max:=−∞; min:=∞ 3. for i := 1 to n/2 do 4. if S[2i − 1] ≤ S[2i] 5. then small:=S[2i − 1]; large:=S[2i] 6. else small:=S[2i]; large:=S[2i − 1] 7. if small < min then min:=small 8. if large > max then min:=small
Suppose that, in a divide-and-conquer algorithm, we always divide an instance of size n of a problem into 10 subinstances of size n/3, and the dividing and combining steps take a time in Θ(n 2) . Write a recurrence
For each question, an algorithm will be described that operates on N elements, and your answer should include: (a) a big-O expression that describes the total number of operations in the worst case (for ex- ample, O(N³)) (b) a description of how to achieve the same effect as the algorithm described, but achieved with a better big-O time bound (for example, "use mergesort instead of insertion sort") (c) the big-O time bound for your improved approach. Your improved algorithm does not need to be provably the best possible, but it should have a different and better big-O bound. (It may not be as simple as substituting one named algorithm for another; consider what is redundant about the work done by the existing algorithm.) You don't need to use pseudocode to describe your algorithms - the style used in the problem descriptions is also sufficient for your solutions. You can use pseudocode if you like. Do not write real code. If you wish to use an algorithm described in class, you can name…
No plagarism please! Correct and detailed answer will be Upvoted else downvoted. Thank you!
Find the running time for each of the following algorithms. Show work by finding a table of values for each while loop, writing the summations, then solving. Be sure to show work on both the upper bound and lower bound, justify the split, and check that the bounds differ by only a constant factor. Use asymptotic notation to write the answer. b) Func3(n) 1 2 3 4 5 6 7 8 9 10 11 S← 0; i+n; while (i 8) do s+ s + i - j; j← lj/⁹]; end i + 4 x i; end return (s);
a certain divide and conquer algorithm splits a problem into 16 sub-instances each of which is about one half of the original size it performs 3n^2 characteristic operations to do the splitting and combining. Let T(n) be the time complexity of the algorithm as a function of its input size n a) Determine a recurrence relation for T(n) b) Determine T's Big-0 complexity class using the master theorem.
Give the asymptotic complexity of each of the following functions in simplest terms and then order the functions by asymptotic dominance. That is, produce a permutation, f₁(n), f₂(n), such that fi(n) = O(fi+1(n)). Note if any two functions are asymptotically equivalent, i.e., if fi (n) = O(fi+1(n)). Note: 'Ig x' is a simpler notation for 'log₂ x'. fe(n)= 4 lg (n²+ 2n) + 6nº.7 f(n) = n5 + 10¹0 lg (n+100) fe(n)= 3n lg (n² + 2) + n²
1. Let S be a set of n arbitrary but distinct numbers. (a) Give a deterministic algorithm to output the largest n³/4 of the numbers in S in sorted order. Your algorithm must use O(n) comparisons. (b) Show that any deterministic comparison-based algorithm that correctly outputs the median on inputs of n distinct elements must use at least n 1 comparisons. To be completely precise, the median is defined to be the [n/2]th smallest element.
Get the time complexity function from the pseudocode for the addition of the 2 matrices below, and prove whether the big-oh is O(n^2) so that it satisfies the rule f(n) <= c g(n) for(i = 0 ; i < rows; i++){for(j = 0; j < columns; j++)matrix2[i][j] = matrix1[i][j] + matrix2[i][j];} for(i = 0 ; i < rows; i++){for(j = 0; j < columns; j++){printf("%d ", matrix2[i][j]);}printf("\n");}