Analyze the worst-case runtime of the new merge sort

Assignment Help Data Structure & Algorithms
Reference no: EM131126233

Assignment : Recursions and Complexity

1. Double Tower of Hanoi contains 2n disks of n different sizes, with two disks of each size. You must move all 2n disks from one peg to another, but you may move only one disk at a time, without putting a larger disk over a smaller one. How many moves does it take to transfer a double tower from one peg to another if disks of equal size are indistinguishable from one another? Find a recurrence relation for the number of moves. Then, solve the recurrence relation.

2. Below is pseudocode for a modified merge sort algorithm. This new algorithm partitions the list into four sublists instead of the usual two:
procedure newmergesort.a[1, ..., n].
input:

output:

if n > 1 then

L1 = merge (newmergesort(a[ 1, ..., |n/4J ), newmergesort.(a[ |n/4J + 1, ..., |n/2J ]
L2 = merge (newmergesort(a[ |n/2J + 1, ..., |3n/4 ], newmergesort a[ |3n/4J + 1, ..., n ])

merge(L1, L2)

Complete the following two problems to determine if it is possible to improve the complexity of merge sort by partitioning the list into more than two lists of smaller sizes.

a) Analyze the worst-case runtime of the new merge sort (you may make reasonable as- sumptions about the length of the list).

b) Compare the complexity of the original merge sort with the complexity of the new merge sort.

3. Solve the following recurrences:

a) T (n) = 7T (n - 1) - 10T (n - 2) for n ≥ 2, T (0) = 2 and T (1) = 1.

b) T (n) = 6T (n - 1) - 8T (n - 2) for n ≥ 2, T (0) = 4 and T (1) = 10.

c) T (n) = T (n - 2) for n ≥ 2, T (0) = 5 and T (1) = -1.

d) T (n) = -4T (n - 1) + 5T (n - 2) for n ≥ 2, T (0) = 2 and T (1) = 8.

Reference no: EM131126233

Questions Cloud

Describe how the following business transactions : Describe how the following business transactions affect the three elements of the accounting equation.a. Invested cash in business.b. Received cash for services performed.c. Paid for utilities used in the business.d. Purchased supplies for cash.e. Pu..
Rhetoric and science final paper assignment : Your final paper will be a 5-8 page analysis of one document from one of the case studies we have covered this semester.  The paper is due by the end of the day on Saturday, July 16.
How plea bargaining affects the criminal justice process : As you learned in your readings this week, a vast majority of criminal cases are resolved through plea bargaining. Evaluate when plea bargaining can occur, the ethics of plea bargaining, and how plea bargaining affects the criminal justice process..
Analyze the worst-case runtime of the new merge sort : Analyze the worst-case runtime of the new merge sort and compare the complexity of the original merge sort with the complexity of the new merge sort.
How constitutional right is practically applied to protect : Explain how the constitutional right is practically applied to protect the individual and/or society as a whole. Provide your personal opinion on the relative strength and/or weakness of this constitutional issue moving forward in the 21st century..
Mba level human resource management online : The responses should include answering the main discussion questions, fully, including proper cites as well.  If you use citaitons I should be able to look it up to use for reference to understand.  The professor requires that the questions be res..
In what phase of the cell cycle is dna replicated : In what phase of the cell cycle is DNA replicated? Tendons and Ligaments heal with scar tissue and do not repair completely due to
Coordinator in the human resources department : Create a training plan for this Customer Service program and include it in your report. Download this Training Plan Template and use it to provide a framework for the development of your Training Plan.

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Describe a dynamic programming algorithm

Let Fi(x) = i * (1+log x). Describe a dynamic programming algorithm to input 2 integers x and m and determine how to break x into m integers x1, x2, ..., Xm such that f1(x1) + f2(x2)+----+fm(Xm) is the largest among all possible ways of breaking x..

  Fill the array using random numbers

Fill the array using random numbers

  Construct the huffman code for the java keyword

Construct the Huffman code for the Java keyword and weights given in the following table

  Computing available storage space

There are twenty gigabyte of space on a computer's hard disk. I transfer information via a telephone line (connection) at the rate of 14,400 bits per second.

  Discuss why it is necessary to balance binary search trees

Discuss why it is necessary to balance Binary Search Trees (BSTs). Calculate the Average Comparison Effort (ACE) value of the BST.

  Model of online music sharing

Since Napster is going out of business, you have decided to begin your own on line music sharing site. You will give individual music documents at your site.

  Algorithm-find schedule to obtain maximum amount of profit

Give an algorithm to find schedule which obtains maximum amount of profit, assuming that all processing times are integers between 1 and n.

  Produce a driver program and the information-retrieval

All words in structure are printed at the terminal in alphabetical order together with their frequency counts

  High bandwidth network for the multimedia team

Assume you have been assigned to build a network for a multimedia development company that currently uses a 10-Mbps Ethernet network. The corporation requires a high bandwidth network for multimedia team.

  Analyze the running time of lca

Prove that LCA correctly prints the least common ancestor of u and ν for each pair {u, ν} ∈P. Analyze the running time of LCA, assuming that we use the implementation of the disjoint-set data structure in Section 21.3.

  Maintain the set of campers enrolled in camp posanivee

Campers are enrolling and withdrawing from camp faster than her primitive filing system can handle, and she has turned to you. You have been offered free meals at the mess hall in return for a program that will help her keep track of who is enroll..

  Calculate the cost of installing fiber optic cable

Write a program that will calculate the cost of installing fiber optic cable at a cost of $0.87 per foot for a company. Your program should display the company name and the total cost

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd