How to analyze complexity of linear search

#1

Can i know what are the steps required for this

#2

Hey,time complexity basically means number of iteration you need to take in worst case.So,for linear search you have to search the entire array if element that you are looking for is not in the array and hence its time complexity is O(n) as you have to check n elements in worst case. n is number of element in the array.

#3

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.