An algorithm that handles 25! (factorial) combinations, is it ok?

Question

Tizen

UPD: The question is incorrect. To calculate 25! combinations need more years than the planet exists.

Answer 1

The second method implies that the programmer must come up with each step of compiling the algorithm in advance so that the correct solution is initially built.

The trouble is that in practice it is impossible to think through each step in advance. And not because it is beyond the power of a person, but because appetites grow later and you will need to add more new functionality, and then another, and another. And this continues until you realize that the current architecture is no longer suitable, and you need to create a new one by rewriting the originally written code.
The first method will also suffer as the system grows.