Can someone help me in java

Ex. of quick sorter

 import java.time.Duration; import java.util.ArrayList; public class QuickSorter { /* * This private constructor is optional, but it does help to prevent accidental client instantiation of QuickSorter * via the default constructor. (defining any constructor prevents the compiler from creating a default constructor) * This particular anti-instantiation technique is exactly what {@link java.util.Collections} does. */ private QuickSorter() { } public static > Duration timedQuickSort(ArrayList list, PivotStrategy strategy) { // TODO implement timedQuickSort(ArrayList, PivotStrategy) } public static ArrayList generateRandomList(int size) { // TODO implement generateRandomList(int) } public static enum PivotStrategy { FIRST_ELEMENT, RANDOM_ELEMENT, MEDIAN_OF_TWO_ELEMENTS, MEDIAN_OF_THREE_ELEMENTS } } 

Ex. of random int

 import java.util.Random; public class ExampleRandomInt { public static final int COUNT = 100; public static void main(String[] args) { /* According to the JavaDoc, the no-args constructor of Random "sets the seed of the random number generator to * a value very likely to be distinct from any other invocation of this constructor." */ Random random = new Random(); // OPTION 1: use the nextInt() method for (int i = 0; i  System.out.println(num) ); } 

ex. of enum

public class ExampleEnum { public static void main(String[] args) { // How to create an enum literal printColor(Color.RED); // How to create an enum variable Color color = Color.GREEN; printColor(color); // You can even print the string representation of an enum value directly System.out.println(Color.BLUE.toString()); } public static void printColor(Color color) { // Using the == operator if (color == Color.RED) { System.out.println("Your color is red!"); } else if (color == Color.GREEN) { System.out.println("Your color is green!"); } else if (color == Color.BLUE) { System.out.println("Your color is blue!"); } // Using a switch statement switch (color) { case RED: System.out.println("Your color is red!"); break; case GREEN: System.out.println("Your color is green!"); break; case BLUE: System.out.println("Your color is blue!"); break; } } public static enum Color { RED, GREEN, BLUE; } } 

Ex. of duration

public class ExampleEnum { public static void main(String[] args) { // How to create an enum literal printColor(Color.RED); // How to create an enum variable Color color = Color.GREEN; printColor(color); // You can even print the string representation of an enum value directly System.out.println(Color.BLUE.toString()); } public static void printColor(Color color) { // Using the == operator if (color == Color.RED) { System.out.println("Your color is red!"); } else if (color == Color.GREEN) { System.out.println("Your color is green!"); } else if (color == Color.BLUE) { System.out.println("Your color is blue!"); } // Using a switch statement switch (color) { case RED: System.out.println("Your color is red!"); break; case GREEN: System.out.println("Your color is green!"); break; case BLUE: System.out.println("Your color is blue!"); break; } } public static enum Color { RED, GREEN, BLUE; } } 

The task of this project is to implement in Java several variations of the in-place QuickSort algorithm, each with a different choice of pivot. You should note the impact on execution time of different pivot selection strategies. Specification The project must implement the following specification exactly, including all identifier names, method signatures, the presence or absence of exceptional behavior, etc. That being said anything not clearly indicated by the UML diagram(s) or explicitly stated in the description is left up to your discretion. You may also add private helper methods or additional fields as necessary Structure QuickSorter static+timedQuickSort>list: ArrayList, pivotStrategy: PivotStrategy): Duration (throws NullPointerException static+generateRandomList(size: int): ArrayListcintegerthrows IllegalArgumentException) enumeration PivotStrategy FIRST_ELEMENT RANDOM ELEMENT MEDIAN OF_THREE_ELEMENTS MEDIAN OF_THREE_RANDOM _ELEMENTS QuickSorter is a static utility class -as such, it should contain only static members and should never be instantiated as an object. The PivotStrategy enumeration should be exactly bundled with (i.e. contained within) QuickSorter, but should be publicly accessible since access to it is required for clients to invoke the timedQuickSort method. The timedQuickSort method is a generic_method that has a type parameter extending va.lang.Comparable, and that returns an instance of java.time Duration For this project, your implementation should not rely on the default package rather you should locate your project in a package exactly named "edu.utdallas.cs3345.project5". This name emulates the official Java package naming conventions, if you're curious Behavion timedQuickSort should accept an array-based list, sort it in-place using the QuickSort algorithm with the specified pivot selection strategy, and return the time in nanoseconds that it took to sort the list. This method should immediately throw a NullPointerException with an appropriate message if either argument is null. This method should not throw any other