Write an efficient algorithm for combining two heaps

Assignment Help Basic Computer Science

Reference no: EM131399507

Consider the problem of combining two heaps together into a single heap.

a. Write an efficient algorithm for combining two heaps, one with size n and the other with size 1. What is the Big Oh performance of your algorithm?

b. Write an efficient algorithm for combining two heaps of equal size n. What is the Big Oh performance of your algorithm?

c. Write an efficient algorithm for combining two arbitrary sized heaps into one heap. What is the Big Oh performance of your algorithm?

d. Implement the algorithm that you wrote in Part c.

Reference no: EM131399507

Questions Cloud

Compare the values of the range for the two groups : Find the five-number summary for Group 1.- Find the five-number summary for Group 2.- Compare the values of the range for the two groups.

Administrators to change the id assigned : The DoGood Donor application contains a page that allows administrators to change the ID assigned to a donor in the DD_DONOR table. Create a PL/SQL block to handle this task.

Write a program that will iterate 1000 times : In the previous step, let n = 10, 20, 30, 40, 50, 60, 70, 80, 90, 100, 200, 400, and 800. For each n, see whether the average number of calls to compareTo is greater than or equal to the lower bound n - 1 (see Exercise 7) and less than or equal to..

Describe the shape of given dataset : Create a dotplot for these ages.- Describe the shape of this dataset.- Are there any outliers in this dataset?- Create a stem-and-leaf plot for these ages.

Write an efficient algorithm for combining two heaps : Write an efficient algorithm for combining two heaps, one with size n and the other with size 1. What is the Big Oh performance of your algorithm?

What is average length of service for staff in organization : What is the average length of service for staff in the organization? What percentage of respondents would recommend the organization to others as a good place to work?

Where in the tree will the largest entry occur : Use a binary search tree in the implementation of MaxHeapInterface. Where in the tree will the largest entry occur? How efficient is this implementation?

Create a stem and leaf plot for the given ages : Create a histogram for these ages.- Create a stem-and-leaf plot for these ages.- Create a dotplot for these ages.

Design strategies for continuous quality improvement : PU500-4: Design strategies for continuous quality improvement in public health.Identify strategies for promoting health equity.Describe how public health practice addresses health concerns locally, nationally, and globally.Leverage policies and laws ..

User Account

All Pages