Explain the No-Free Lunch (NFL) theorem in the context of optimization and search algorithms. Discuss the theoretical implication that no single optimization algorithm is superior to all others when averaged over all possible cost functions. How does this theorem influence the selection of algorithms for specific real-world problems?