Question: Problem 1 For each algorithm listed below, give a recurrence that describes its worst-case running time, and give its worst-case running time using -notation. You

Problem 1 For each algorithm listed below, give a recurrence that describes its worst-case running time, and give its worst-case running time using -notation. You need not justify your answers. (a) Merge sort (b) Insertion sort (c) Merge's algorithm (d) Binary Search Problem 2 Do Quicksort on the input numbers 12,7,10,3,8,6. Illustrate the execution using a binary tree where each node is an array or subarray when calling the PARTITION procedure. The two children of a node are the subarrays immediately after partitioning their parent array. Problem 3 Consider a variation of MergeSort which divides the list of elements into two lists of size 2/5 and 3/5, recursively at each step, instead of dividing it into halves. The Merge procedure does not change. (a) Give a recurrence relation for this algorithm (b) Draw a recursion tree for the algorithm (c) Using the recursion tree, explain how the worst case upper bound is O(nlogn)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!

(a) Sets containing integers can be represented as int list values. Consider two such representations called unordered and ordered. In the former elements can appear in any order; in the latter...

Given an unsorted array A of n distinct integers and an integer k , you need to return the k smallest integers In the array in sorted order, where k may be any infeger between 1 and n . Suppose that...

A certain program has to maintain an array, count, of N counters which are all initialised to zero. The value of counter i can be incremented by one by the call: increment(i), and this is the only...

Problem 4 (20 points). Consider a priority queue that supports INSERT and ExTRACT-MAx operations. Given a sequence S of these operations on a set of keys {1...n, we would like to record the sequence...

Problem 4 (20 points). Consider a priority queue that supports INSERT and ExTRACT-MAx operations Given a sequence S of these operations on a set of keys {1...n], we would like to record the sequence...

Give the typing rules for Peano natural numbers and their eliminator.(ii) Using the rules given above, define the addition function.] (iii) Let a binary tree be either a leaf Leaf or a node...

Describe an algorithm to generate G2 from G1. [12 marks] How could this algorithm be used to generate the transitive closure of a graph given its adjacency matrix? [5 marks] What is the cost of this...

3. Consider the following recursive algorithm: Preconditions: A is an array of integers. f and are integers such that Osfs (e- f +1)/2: 12 return r 13 eturn maj(A, m +1,e) (a) Let T(n) denote the...

3. Consider the following recursive algorithm: Preconditions: A is an array of integers. f and l are integers such that 0sfs& (e- f +1)/2: 12 13.return maj(A, m 1,) i-i+1 return r (a) Let T(n) denote...

3. Consider the following recursive algorithm: Preconditions: A is an array of integers. f and l are integers such that 0 s f (l- f +1)/2: 12 13 eturn maj(A, m1, ) return r (a) Let T(n) denote the...

Reviewing the statement of cash flows from 2017 for Amazon and Target, what types of cash flow conclusions can you draw based on the information provided?

Under what two conditions would the multiple production department factory overhead rate method provide more accurate product costs than the single plant wide factory overhead rate method?

11.40 The data for total sales (x) of a company and its expenditure towards advertisement (y) for 2014 is given as follows: x (in million units) y (in000 dollars) 170 23 190 24 220 31 235 30 245 32...

5. Develop a scenario comparing two PH programs and involving the use of a CBA.

Who are your three closest friends? Are they members of any organizations that you belong to? If so, has your joint membership affected the friendship in any particularly positive or negative ways?...

Are you involved with or familiar with any organizations that favor hierarchy and a division of labor? What are the pros and cons for communication in such organizations?

Do members cooperate freely with one another, fulfilling the responsibilities theyve agreed to shoulder and pitching in when needed?