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

  Implement an open hash table

In this programming assignment you will implement an open hash table and compare the performance of four hash functions using various prime table sizes.

  Use a search tree to find the solution

Explain how will use a search tree to find the solution.

  How to access virtualised applications through unicore

How to access virtualised applications through UNICORE

  Recursive tree algorithms

Write a recursive function to determine if a binary tree is a binary search tree.

  Determine the mean salary as well as the number of salaries

Determine the mean salary as well as the number of salaries.

  Currency conversion development

Currency Conversion Development

  Cloud computing assignment

WSDL service that receives a request for a stock market quote and returns the quote

  Design a gui and implement tic tac toe game in java

Design a GUI and implement Tic Tac Toe game in java

  Recursive implementation of euclids algorithm

Write a recursive implementation of Euclid's algorithm for finding the greatest common divisor (GCD) of two integers

  Data structures for a single algorithm

Data structures for a single algorithm

  Write the selection sort algorithm

Write the selection sort algorithm

  Design of sample and hold amplifiers for 100 msps by using n

The report is divided into four main parts. The introduction about sample, hold amplifier and design, bootstrap switch design followed by simulation results.

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