Please give me an explanation of the step by step.

Code the insertion sort in C++. Create 2 .cpp files: sortMain.cpp and insertionSort.cpp. Below is a template that you should use:

 //---------------------------------------------------------------------- //file: sortMain.cpp #include  extern void insertionSort ( int A[], int n ); using namespace std; int main ( int argc, char* argv[] ) { . . . return 0; } //---------------------------------------------------------------------- //file: insertionSort.cpp void insertionSort ( int A[], int n ) { . . . } 

Run the sort on input sizes of 10, 100, 1000, 10000, 100000, 200000, 300000, 400000, 500000, and 1000000 of random values. Depending upon the speed of your computer, you may only be able to run one or a few sorts for larger input sizes. Report the array size n (N), number of test iterations (#), total elapsed time (tElapsed), total CPU time (tCPU), average CPU time (avgCPU) for insertion sort in a table like the following:

Note: You may need to allocate your arrays dynamically as follows, int[] A = new int[ N ]; rather than statically as in int A[ N ];.

insertion sort
N	#	tElapsed	tCPU	avgCPU
10
100
1000
10000
100000
200000
300000
400000
500000
1000000