For the following example attached, what would a JUnit tester example look like that would prove this Heapsorter worked as stated…?

HeapSort.java

import java.util.ArrayList;

import java.util.Comparator;

public class HeapSort

public void sortingHeapTree(ArrayList

int n = arr.size();

for (int i = n / 2 – 1; i >= 0; i–)

HeapTreeConstruction(arr, n, i, c);

for (int i = n – 1; i >= 0; i–) {

T temp = arr.get(0);

arr.set(0, arr.get(i));

arr.set(i, temp);

HeapTreeConstruction(arr, i, 0, c);

}

}

void HeapTreeConstruction(ArrayList

int root = i; // Initialize largest as root

int l = 2 * i + 1; // left = 2*i + 1

int r = 2 * i + 2; // right = 2*i + 2

if (l < n && c.compare(arr.get(l), arr.get(root)) > 0)

root = l;

if (r < n && c.compare(arr.get(r), arr.get(root)) > 0)

root = r;

if (root != i) {

T swap = arr.get(i);

arr.set(i, arr.get(root));

arr.set(root, swap);

HeapTreeConstruction(arr, n, root, c);

}

}

static void printArray(int arr[]) {

int n = arr.length;

for (int i = 0; i < n; ++i)

System.out.print(arr[i] + ” “);

System.out.println();

}

public static void main(String args[]) {

HeapSort

ArrayList

list.add(“A”);

list.add(“ABCDEF”);

list.add(“BSC”);

list.add(“AB”);

list.add(“CGED”);

list.add(“DC”);

list.add(“ABCDE”);

System.out.println(“Before Sorting: “+list);

heap.sortingHeapTree(list, new StringComparator());

System.out.println(“After Sorting: “+list);

}

}

StringComparator.java

import java.util.Comparator;

public class StringComparator implements Comparator

@Override

public int compare(String s1, String s2) {

return s1.length()-s2.length();

}

}

Output:

Before Sorting: [A, ABCDEF, BSC, AB, CGED, DC, ABCDE]

After Sorting: [A, DC, AB, BSC, CGED, ABCDE, ABCDEF]