As described in Section 21.5 of your textbook, it is possible to make the heap sort algorithm more efficient by writing a method that will build a heap in place using the array to be sorted. Implement such a method and rewrite the heap sort algorithm to make use of it. Show test cases for various inputs, including sorted and unsorted inputs.

As described in Section 21.5 of your textbook, it is possible to make the heap sort algorithm more efficient by writing a method that will build a heap in place using the array to be sorted. Implement such a method and rewrite the heap sort algorithm to make use of it. Show test cases for various inputs, including sorted and unsorted inputs.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

We have an array of randomly distributed data nodes. Explain the heap sort algorithm for sorting the data in the descending order, i.e. largest to the smallest value. Please write your algorithm in a list form to make it more readable.
1. Implement a generic version of Bubble sort, Selection sort and Quick sort algorithms (use static method). 2. During the implementations count how many comparisons each algorithm required for performing ascending order sorting. Print that count. 3. Test your algorithms by taking two random list: one will take Double type value and other will take String type value (this will verify your generic implementation). Invoke each of the sorting algorithm by passing one list at a time and display both the original list and the sorted list.
The insertion sort was discussed and the implementation was demonstrated in the sorting lecture. In this assignment, you are asked to re-implement the insertion sort (InsertionSort.java),with additional requirements. Particularly, you need to show:1. For each iteration, how a number from a unsorted region is placed in the correctionposion in the sorted region;2. How to make the whole array be sorted based on the previous step, and count the totalnumber of shifts during the whole insertion sort process.2 Details of the ProgramTo complete the whole implementation, you should write at least the following importantmethods:2.1 Part1: insertLast/**A method to make an almost sorted array into fully sorted.@param arr: an array of integers, with all the numbers are sortedexcepted the last one@param size: the number of elements in an array*/public static void insertLast(int[] arr, int size){// your work}To make it concrete, let’s use the example shown in Figure 1. In this example, the…
Min Heap of Candy — Add and Remove Using the provided code (Question04.java and Candyjava), write the add and remove methods for a min heap of Candy using an array implementation. Make sure to include all provided files in your project and write your solution in the file "Question04.java". This method should preserve the properties of a min hap, and the candies are compared based on their weight. This value can be accessed through its accessor. Solution Tests: • Does the solution compile? • Does the solution have your name in the comments? • Does the solution have a high-level solution description (150-300 words) in the comments? • Does the method preserve the properties of a Min Heap? • Does the output match the following? Testing the Add Method Candy Weight: 10.0, Candy Weight: 40.0, Candy Weight: 20.0, Candy Weight: 50.0, Candy Weight: 60.0, Candy Weight: 80.0, Candy Weight: 30.0, Candy Weight: 100.0, Candy Weight: 70.0, Candy Weight: 90.0, Testing the Remove Method Candy Weight:…
Suppose you want to use Heapsort to sort the contents of the following array in alphabetical order: [C; A; G; B; D; F; E]. Answer the two questions that follow. What follows is a fill in the blank question with 7 blanks. Show the array's contents after the heapBuild method has been performed, i.e. when the array represents a heap. Fill in only one letter in each space. [ Blank 1. ____________ ; Blank 2. _____________. ; Blank 3. ______________ ; Blank 4. ___________. ; Blank 5. ___________. ; Blank 6. _______________ ; Blank 7.___________ ] [Hint: think whether you need a max or a min heap to sort in alphabetical order]
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Heapsort has heapified an array to: 76 62 40 32 30 and is about to start the second for loop. What is the array after each loop iteration? i= 4: Ex: 86, 75, 30 i = 3: i = 2: i= 1:
Sorting is useful as the first step in many different tasks. The most common task is to make finding things easier, but there are other uses as well. In this case, it will make it easier to determine which pair or pairs of elements have the smallest absolute difference between them. Example [5, 2, 3, 4, 1] arr = Sorted, arr' = [1, 2, 3, 4, 5]. Several pairs have the minimum difference of 1: [(1,2), (2, 3), (3, 4), (4, 5)]. Return the array [1, 2, 2, 3, 3, 4, 4, 5]. Note As shown in the example, pairs may overlap. Given a list of unsorted integers, arr, find the pair of elements that have the smallest absolute difference between them. If there are multiple pairs, find them all. Function Description Complete the closestNumbers function in the editor below. closestNumbers has the following parameter(s): int arr[n]: an array of integers Returns - int[]: an array of integers as described Input Format The first line contains a single integer n, the length of arr. The second line contains n…
2.) Consider an input array A of size n in which n − 1 of the elements have identical values and the remaining one value is smaller than the n − 1 identical values. What is the running time of Heapsort with input A?
In an array-based implementation of a List, why does the add operation take O(n) time in the average case? Select one: a. The time it takes to shift entries over to make room in the array depends on the number of entries in the List b. The time to copy the current entries into a newly allocated, larger array depends on the number of entries in the List c. The time to access the position in the array to add the new entry depends on the number of entries in the List d. The time to access the position in the array to add the new entry depends on the capacity of the array
Activity Research for heap sort and its uses. Now, your task is to create an array of names that includes the names of your grandparents, parents, and your siblings. Using heap sort, arrange these names alphabetically. List down the names first, then do heap sort right after.
Write and implement a recursive version of the binary search algorithm. Also, write a version of the sequential search algorithm that can be applied to sorted lists. Add this operation to the class orderedArrayListType for array-based lists. Moreover, write a test program to test your algorithm.