Question

Determine and explain the functionality of the following code fragment:
int functionl (int a[], int n, int x)
int i; for (i = 0; i<n && a[i] != x; i++)
if (i == n) return -1;
else return i;
Compute the best case, worst case and average case time complexity of the
above function 1. Explain your answers.​

Answer 1

Explanation:

follow me

I don't know the answer

mark me as brainliest

I hope it is useful