Looking for a faster performance...of Damon Ostrander's code.
str1 is limited to 24 characters max since the algorithm takes a bit of time (it's exhaustive in it's comparison against ordered combinations).
I need help with augmenting the code to reflect if a match is found that it does not...