So I've got this problem that I think requires a recursive function
Distilling it down - basically I'm provided with this humongous list of translations (7000+) from various languages to other languages, and a query.
I'm supposed to determine the amount of languages each word in query needs to be translated to before it returns to its original language - (e.g. Bird translated to serbian is [i]ptica[/i] and [i]ptica[/i] is translated back into English as [i]Flier[/i] - a total distance of 3 languages (ENG to SER and back to ENG again), and do a bunch of stuff from there, but that's the most important bit.
My only hang-up is runtime. Is it feasible to use recursion here (I've got limited runtime) or should I just stick with the iterative method? (i'm hopeless at Python if you haven't figured that out already.)