SHA-256
The process of guessing the values of the algorithm is random.The random guess of the algorithm then needs to be combined (concatenated?) with a nonce (or input used once at a unique occasion) , hashed again then matched to the complexity of a block. If there is no match then try again. To match an algorithm at a specific time of difficulty is solving for a limit at infinity.