The answer should be intuitive.
Some algorithms are literally much 'faster' than others. If the hash wasn't really designed for cracking-resistant password storage - such as MD5 - then it's quite fast to attack because the math required to perform the calculation is trivial.
By contrast, if a hash *was* designed to be cracking-resistant (for example, by requiring thousands of rounds of an operation or other 'stretching' techniques) - such as scrypt, bcrypt, etc. - then it will be slow to crack.
Some algorithms are literally much 'faster' than others. If the hash wasn't really designed for cracking-resistant password storage - such as MD5 - then it's quite fast to attack because the math required to perform the calculation is trivial.
By contrast, if a hash *was* designed to be cracking-resistant (for example, by requiring thousands of rounds of an operation or other 'stretching' techniques) - such as scrypt, bcrypt, etc. - then it will be slow to crack.
~