what is the time complexity of linear search as well as binary search plz tell
Doubt regarding time complexity
@aarijrab, the time complexity of linear is o(n) as in the worst case we don’t find the key element ,we have to search the entire array length ,
for binary search it’s o(logn) refer this discussion for derivation : Time Complexity
In case of any doubt feel free to ask 