Hello, I need to implement a sorting algorithm using NetBeans 8.2 and Java language.

The sorting algorightm is QuickSort. Your Quicksort algorithm must use the median-of-three method to determine the pivot, and must use the Hoare Partition algorithm.

This algorithm will have to sort numbers in ascending order. Has to read the input file that will be a file with 10 randoms numbers. The file name is 10.txt.

For example. 10.txt:

-1,2,3,-2,10,24,-68,-90,98,54

You must also have a function confirmSorted(). This function should take your array of numbers, verify that it is sorted in ascending order, and return a Boolean. If the numbers are confirmed to be sorted, print out Confirmed sorted and if they arent sorted, print out Confirmed NOT sorted. Do this before and after the sort.

Also, all programming languages have ways to get elapsed time in milliseconds. The basic idea is to get the time (in milliseconds) before sorting, after sorting, and then find the difference between them.

This image is just an example of how it should look after running the program.

Sample output Below is an idea of what kind of output your program should have Reading data from 100000.txt Confirmed NOT sorted. Sorting using Quicksort. It took 150 ms. Confirmed Sorted