Im suppose to give the asymptotic estimate (that is the most precise) for the number of steps as a function of n. Assum the worst case data! I know what this program does but I have no idea how to figure out the answer.

Code:bool Found = false; i = 0; while(!Found && (i <n)) if(A[i] == key) Found = true; else++;