Needed in python thank youSolutionimport timeit def builtInp
Solution
import timeit
def builtInput():
list = [4,1,9,3,5]
num = 13
tuple = (list,num)
return tuple
def pairs1(list,num):
for i in range(len(list)):
for j in range(1,len(list)):
if(list[i]+list[j]==num):
return True
return False
def pairs2(list,num):
list.sort()
for i in range(len(list)):
temp = num - i
# search for the other number in list or not.
if(temp in list[i:]):
return True
return False
def timeAnalysis():
\" Time between start and end is the running time of the funciton.\"
start = timeit.default_timer()
print pairs1([4,1,9,3,5],13)
stop = timeit.default_timer()
print stop - start
start = timeit.default_timer()
print pairs2([4,1,9,3,5],13)
stop = timeit.default_timer()
print stop - start
timeAnalysis()
# sample output
#
# pairs2 would be taking lesser time compared to pairs1.
![Needed in python, thank you.Solutionimport timeit def builtInput(): list = [4,1,9,3,5] num = 13 tuple = (list,num) return tuple def pairs1(list,num): for i in Needed in python, thank you.Solutionimport timeit def builtInput(): list = [4,1,9,3,5] num = 13 tuple = (list,num) return tuple def pairs1(list,num): for i in](/WebImages/23/needed-in-python-thank-yousolutionimport-timeit-def-builtinp-1056558-1761551308-0.webp)