so I have two python lists of ids with other info that I am looping through. I try and match up the ids and assign row values based on the id join.
the example below is just a generic test on what I am actually doing but once I understand how to solve what I need I will be able to apply it to my example.
for row in l1:
for info in l2:
if row[0]==info[0]:
row[1]=info[1]
each list respectively has about 11,000 rows in it so looping through the l1 then looping through every row in the l2 list to match up the ids takes a very long time. I was wondering if there is to say, okay since l1 id number 3 got iterated through and had the process finish for that id, then when the next row in l1 is being iterated l2 will now no NOT to even search for id number 3 which was processed already in the row before it.
I usually run a process like this in SQL, where it would sort of like a self join...
if somebody downvotes can they at least tell me why!