"OBJECTIVES $$ To understand sorting algorithms better

INSTRUCTIONS Implement from scratch $($i$.$e$.,$ don$$t use built$-$in algorithms provided by the host language$)$ both QuickSort, and InsertionSort. Compare their running times on sets of integers of size $250$ QL$05,500,750,1000,2500.$ You can generate these sets using the language$$s built$-$in Randomization techniques $($e$.$g$.,$ pseudorandom number generators$).$

Which appears to perform better as the number of integers increases? Why did you get the results you did?

Make sure to run each algorithm at least $5$ times on each set size $($five times for set size of $250,$ five times for $500,$ etc. $$ for EACH algorithm.$)$

Hint: Make use of the System.nanoTime$()$ method of System.

E$.$g$.,$

long startingTime $=$ System.nanoTime$()$;

long total $=0$;

$//$do something here: run an algorithm to test timing on

long stoppingTime $=$ System.nanoTime$()$;

long elapsed $=$ stoppingTime $-$ startingTime;

System.out.println$($elapsed$)$;

This obtains the current time from the system at the beginning, then after the algorithm being tested is performed, get the stopping time. Then, find the difference, referred to as the elapsed time, and do something with it$.$ Record in a table, in say, MS Excel for this assignment. Write a short discussion about why you believe you received the results that you did."