L85: Warm up for binary search | obvious search & time complexity

Transcript

So, let us now try writing a piece of  code which will check if a given element k is present in a list L or not. A pretty  straightforward code, let us call it the obvious search. In fact, we have done this  already. So, I will be a little fast here. So, what do we do? For x in L, you go through all the  elements of L. And if in case x is equal to ... Read More