In the below mentioned code,my outer loop runs unnecessarily even if the condition is satisfied at the first iteration.I dont want to run the nested loop unnecessarily.How to reduce the nested loop complexity to increase the code performance?
for i in List1:
for j in sourceList:
for k in List2:
if (j[0]==i[1] and j[1]==k[1]):
print (i[0],k[0])
You can check the first condition if j[0] == i[1] before starting the innermost loop, and break on the first match.
for i in List1:
for j in sourceList:
#Check condition and only then run inner loop
if j[0] == i[1]:
for k in List2:
#Break out of loop on first match
if j[1] == k[1]:
print(i[0], k[0])
break
else:
continue
Considering your goal is to print line by line i[0], k[0], you could use list comprehensions to reduce the complexity of a for loop as follows:
'\n'.join(f'{i[0]},{k[0]}' for i in List1 for j in sourceList if j[0]==i[1] for k in List2 if j[1]==k[1])
for, also not sure how using a list comprehension reduces complexity? You still have 3 for loops
You can do break:
for i in List1:
for j in sourceList:
for k in List2:
if (j[0]==i[1] and j[1]==k[1]):
print (i[0],k[0])
break
Or use a def (function):
def f():
for i in List1:
for j in sourceList:
for k in List2:
if (j[0]==i[1] and j[1]==k[1]):
return (i[0],k[0])
break will only do half the job: it will only exit the third for loop.
return.i[0],k[0]matches, or just one. Also you saymy outer loop runs unnecessarily even if the condition is satisfied at the first iterationbut you have two outer loops here which one do you want to reduce the complexity off? Also giving examples of how all these lists look like, and expected output will also help