In JAVA** What would a generic radix sorter look like that computed the same function on Strings as my EXAMPLE (below), that checks true, or throw an exception….? EXAMPLE: StringComparator.java import java.util.Comparator; public class StringComparator implements Comparator { @Override public int compare(String s1, String s2) { return s1.toLowerCase().compareTo(s2.toLowerCase()); } } HeapSort.java import java.util.ArrayList; import java.util.Comparator; public class HeapSort { public void sortingHeapTree(ArrayList arr, Comparator c) { 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 arr, int n, int i, Comparator c) { int root = i; // Initialize largest as root int l = 2 * i + 1; // left = 2i + 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 heap = new HeapSort<>(); ArrayList list = new ArrayList<>(); list.add("Hi"); list.add("hello"); list.add("Xike"); list.add("shoot"); list.add("Zake"); list.add("Main"); list.add("mary"); System.out.println("Before Sorting: " + list); heap.sortingHeapTree(list, new StringComparator()); System.out.println("After Sorting: "); for (String s : list) { System.out.println(s); } } }

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

Computer Science ** In JAVA** What would a generic radix sorter look like that computed the same function on Strings as my EXAMPLE (below), that checks true, or throw an exception….? EXAMPLE: StringComparator.java import java.util.Comparator; public class StringComparator implements Comparator { @Override public int compare(String s1, String s2) { return s1.toLowerCase().compareTo(s2.toLowerCase()); } } HeapSort.java import java.util.ArrayList; import java.util.Comparator; public class HeapSort { public void sortingHeapTree(ArrayList arr, Comparator c) { 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 arr, int n, int i, Comparator c) { 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 heap = new HeapSort<>(); ArrayList list = new ArrayList<>(); list.add("Hi"); list.add("hello"); list.add("Xike"); list.add("shoot"); list.add("Zake"); list.add("Main"); list.add("mary"); System.out.println("Before Sorting: " + list); heap.sortingHeapTree(list, new StringComparator()); System.out.println("After Sorting: "); for (String s : list) { System.out.println(s); } } }

Expert Solution

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions