What's the name of this theorem that states 'Any opt. algorithm that performs well in a domain, its average performance on all others will be subpar'?

Question

I'm looking for the name of the theorem that stated, approximately, that given any optimization algorithm that performs well when solving a specific problem, its average performance on any other conceivable problem is lower than the average performance of any other conceivable algorithm tackling the same problems.

So in short, that if an algorithm performs well in a domain, its average performance on all other domains will be subpar.

Answer 1

Are you referring to the No Free lunch theorem? https://en.wikipedia.org/wiki/No_free_lunch_theorem

(I know this should be a comment, but I don't have 50 reputation points.)