Implement Heapsort using a maxHeap to sort the following elements: 45, 90, 85, 62. You should first build a maxHeap with these elements and then proceed to do the sorting. Please include a main method in your code to test your Heapsort implementation.

Solution PreviewSolution Preview

These solutions may offer step-by-step problem-solving explanations or good writing examples that include modern styles of formatting and construction of bibliographies out of text citations and references. Students may use these solutions for personal skill-building and practice. Unethical use is strictly forbidden.

public class HeapSort
    static int[] a = {0, 45, 90, 85, 62}; // The array to be sorted, the array starts from index 1
    static int size = 4; // Number of elements in array, index 0 is not counted
    // Swaps elements in array at index1 and index2
    static void swap(int index1, int index2)
       int tmp = a[index1]; // copy array element at index 1 to a tmp variable
       a[index1] = a[index2]; // copy array element at index1 to element at index2
       a[index2] = tmp; //copy stored value in tmp to array element at index2

By purchasing this solution you'll be able to access the following files:

50% discount

$13.00 $6.50
for this solution

or FREE if you
register a new account!

PayPal, G Pay, ApplePay, Amazon Pay, and all major credit cards accepted.

Find A Tutor

View available Java Programming Tutors

Get College Homework Help.

Are you sure you don't want to upload any files?

Fast tutor response requires as much info as possible.

Upload a file
Continue without uploading

We couldn't find that subject.
Please select the best match from the list below.

We'll send you an email right away. If it's not in your inbox, check your spam folder.

  • 1
  • 2
  • 3
Live Chats