Calculating Execution Time for

Sorting algorithms

Write implementations for Insertion sort and quick sort algorithms; apply these implementations for lists of different lengths, to find the execution time in each case. Then fill the results in a table such as below.

In your program you have to apply each algorithm at least $2$ times for each data and take the average run time for the $2$ attempts.

Execution time for Insertion sort Execution time for Quick sort Execution time for

Min Max

List of size $1000$

List of size $10000$

List of size $100000$

You can use the following statements for estimating execution time:$-$

import java.util.concurrent.TimeUnit;

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

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

long timeElapsed $=$ endTime $-$ startTime;