In the Java language

The source code to modify:

import java.io.File; import java.util.Scanner; import java.util.Map.Entry; import java.util.AbstractMap; import java.util.Arrays; import java.util.Comparator; public class WordCountHeap { /** Merge two strings. See the textbook for explanation. **/ public static void merge(String[] S1, String[] S2, String[] S) { int i = 0, j = 0; while (i + j = 1; k--) sink(a, k,n); } private static void heapSort(String[] pq) { int n = pq.length; constructHeap(pq); while (n > 1) { exch(pq, 1, n); n--; sink(pq, 1,n); } } private static void sink(String[] pq, int k, int n) { //your code goes here } /** Note that less and exch are defined to offset the 1-based array **/ private static boolean less(String[] pq, int i, int j) { return pq[i-1].compareTo( pq[j-1]) count_ARRAY_SORT(String[] tokens, String sortMethod) { int CAPACITY = 1000000; String[] words = new String[CAPACITY]; int[] counts = new int[CAPACITY]; if (sortMethod.equals("HEAP")) heapSort(tokens); else if (sortMethod.equals("MERGE")) mergeSort(tokens); else System.out.println(sortMethod + " sorting method does not exist."); int j = 0, k = 0; int len = tokens.length; while (j  maxCount) { maxWord = words[i]; maxCount = counts[i]; } } // HeapInt h=new HeapInt(counts); // for (int i=0; i(maxWord, maxCount); } static String[] readText(String PATH) throws Exception { Scanner doc = new Scanner(new File(PATH)).useDelimiter("[^a-zA-Z]+"); // tokenize text. any characters other than English letters(a-z and A-Z // ) are delimiters. int length = 0; while (doc.hasNext()) { doc.next(); length++; } String[] tokens = new String[length]; Scanner s = new Scanner(new File(PATH)).useDelimiter("[^a-zA-Z]+"); length = 0; while (s.hasNext()) { tokens[length] = s.next().toLowerCase(); length++; } doc.close(); return tokens; } public static void main(String[] args) throws Exception { String PATH = "/Users/PATH/code/dblp"; String[] METHODS = { "HEAP","MERGE"}; String[] DATASETS = { "200", "500", "1k", "5k", "10k", "100k", "1m", "" }; String[] tokens; // run the experiments on different data sets for (int j = 0; j  entry = count_ARRAY_SORT(tokens, METHODS[i]); long endTime = System.currentTimeMillis(); String time = String.format("%12d", endTime - startTime); System.out.println(METHODS[i] + " method\t time=" + time + ". Most popular word is " + entry.getKey() + ":" + entry.getValue()); } } } }