Urgent help needed in C++ code !

Using this formula

Average Case In this project we will try to match the Average Case of algorithm A10 as we derived in class and the Real Average of the algorithm using Monte Carlo approach. A10: void Insertion (int A[ ], int n) // in reality the elements to be sorted are indexed from // index 1 to index n { int i,j, temp; A[0]=-32768; //smallest possible integer using 2 bytes integer representation for (i=1; i But we are inserting n elementee las 72 72 i+1 1 1,n(n+1) , So the "order" of the average case is the same as the worst-case, thus no big deal here). But we are inserting n elementee las 72 72 i+1 1 1,n(n+1) , So the "order" of the average case is the same as the worst-case, thus no big deal here)