Can anyone attest to the validity of the No Free Lunch theorem? What if I created an algorithm that had access to every other possible algorithm ever created,

Can anyone attest to the validity of the No Free Lunch theorem? What if I created an algorithm that had access to every other possible algorithm ever created, and chose to use the optimal algorithm for the given task? Would that algorithm-seeking algorithm do better at every task than random chance? Would that algorithm-seeking algorithm break the No Free Lunch theorem?