What is the growth rate function and time complexity of the following code:

Question

void fun(int n, int arr[ ])

{

int i, j, k=0;

for(; i<n ;++i)

while(j<n && arr[i]< arr[j ])

j++;

}

Answer 1

N * n/2 on average