Java

Please Comment on your process and what is occurring in the program.

public class Example { public static void sort(Comparable[] a) { /* See Algorithms 2.1, 2.2, 2.3, 2.4, 2.5, or 2.7. */ } private static boolean less(Comparable v, Comparable w) { return v.compareTo(w)

-------------------------------------

SortData Contents:

DoubleValue.txt

40.61 5.161 8.551 114.26 56.574 -21.453 140.616 62.134 141.648 -20.153 -74.95 7.023 22.991 78.941 -99.844 -58.318 60.655 80.176 48.896 -3.097 48.591 46.771 -145.81 40.115 126.086 -70.795 -123.055 -73.492 10.763 99.288 -137.508 70.482 56.884 -64.903 -133.16 41.23 -25.97 60.868 -20.37 -130.907 112.2 70.123 93.686 -------------------------------------------------------------

StringValues.txt

Extended Distributed Up-sized Devolved even-keeled framework User-centric architecture next generation Function-based local area network Robust Future-proofed productivity discrete De-engineered responsive Enhanced framework Multi-layered matrix hierarchy User-centric Extended Organic Vision-oriented Realigned grid-enabled Virtual parallelism zero administration object-oriented human-resource optimizing service-desk framework

Following the Example class template, implement a reverse sort class that sorts in reverse (highest to lowest) using a selection sort. Use it to sort the two data files. Make sure to print the data before and after sorting. Data