What is the big oh performance of this method

Assignment Help Basic Computer Science

Reference no: EM131399529

Heap sort is not the only way to sort an array using a heap. In this exercise you will explore a less efficient algorithm. After building an initial heap, as you would in the first step of a heap sort, the largest value will be in the first position of the array. If you leave this value in place and then build a new heap using the remaining values, you will get the next largest value in the entire array. By continuing in this manner, you can sort the array into descending order. If you use a minheap instead of a maxheap, you will sort the array into ascending order.

a. Implement one of these sorts as the method newSortUsingAHeap.

b. What is the Big Oh performance of this method?

Reference no: EM131399529

Questions Cloud

Explain why an on-boarding process needs to be created : Bus 325-Explain why an on-boarding process needs to be created. Then create an outline of an on-boarding process. Include a brief explanation of each step and explain why it is important.

Specify and implement a class of binary search trees : Provide a method that searches the tree for a given entry and returns the first one it finds. Also, provide a similar method that returns a list of all entries that match the given one.

Provide evidence to support your financial projections : You work for a company that builds and purchases privately held businesses. Provide evidence to support your financial projections and business case

Choose a research question and conceptualize your variables : Create and conduct a brief survey regarding an issue or topic of your choice related to sociology. Look at the chapter titles in the book for ideas. In your assignment summary paper, summarize your findings, draw conclusions regarding your researc..

What is the big oh performance of this method : By continuing in this manner, you can sort the array into descending order. If you use a minheap instead of a maxheap, you will sort the array into ascending order.

A tough road north for central american children : To stimulate your thinking about the ongoing refugee crisis, I have created a section on the web page (left hand side) called UNHCR stories. The weekend before each class, I will add a link to a news article on the UNHCR website.

Write an algorithm that will give you a heap again : Consider an array that represents a heap. Suppose that you replace the value at index i with a new value. It is likely that you will no longer have a heap. Write an algorithm that will give you a heap again.

Determining the desaster recovery : A disaster recovery plan is a set of policies and procedures designed to mitigate the damage of a disaster. Research some best practices for Disaster recovery. Discuss your findings.

Compare the performance of two binary search trees : Generate 10 random values between 0 and 8000. Add these values to each tree in the same order. After each of these additions, update each tree's comparisonSum variable by the number of comparisons performed for the insertion.

User Account

All Pages