Please assist so that I can complete the following:
You will create a program that runs a sorting algorithm on a set of randomized values. Your program should run the algorithm several times, to get the average time for each sorting technique.
2. Run your program through a sorting algorithm to sort this information using two different sorting techniques. Find the average length of time that it takes by running the program at least five times for each sorting technique.
4. In a post to the discussion below, respond to the following questions about your results:
How does the algorithm you chose affect the result of the sort?
How do the algorithm techniques of fragmentation affect the end result of sorting through larger amounts?
This solution provides a sorting algorithm written in Java.