Do you mean any hash algorithms that are reversible? If that is your question, then the answer is no. Generally speaking, a hash algorithm is a function that takes in any length of data (a password, or a file), and spits out a fixed length output. This output value is meant to be a UNIQUE value for the given input. One commonly generates the hash algorithm of a file to check if it has been changed, because even the tiniest change of the input will cause a very different output.
For example, I have an executable file, and I generate the hash algorithm. I then put it online for download and put the hash algorithm up for all to view. Then, if someone downloads my executable file from a different website, they can generate the hash algorithm of it and see if it matches the hash algorithm I posted on my website, thus proving that it has been unchanged, and is the same file.
NOW, because hash algorithms produce a fixed length output, there is a possibility that multiple different inputs can generate the SAME hash value output. This is why MD5 has been deemed unsafe and broken. It is suggested to use SHA-1 over MD5 because the fixed-length value output is 40 bit as opposed to MD5's 32 bit.
Hope I make sense.