Question: write a Python function that takes in a list of integers (L), and a key (K), the function should search for K in L and
write a Python function that takes in a list of integers (L), and a key (K), the function should search for K in L and return the location (i.e., index) of K in L, and if K does not exist in L, then the function should return -1. You need to use the most efficient algorithm and you cannot use any built-in function (.find()). What is the time complexity of your functions?
def find(L, K):
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
