Question: What will be the time complexity of the following code segment? Give reason for your answer.

Answer without an adequate explanation will be given zero credit.

ave = 0.0;

for (int j=0; j

ave += A[j];

ave = ave / A.length;

j = 0; count = 0;

do {

while ( ( A[j] != ave ) && ( j < A.length ) )

j++;

if ( j < A.length )

{

A[j++] = 0;

count ++;

}

} while (j < A. length)

Here, A is an int array of size n.