Here's an O(∞) solution inspired by bogosort. If it halts, a and b are anagrams.
a
b
def anagrams(a, b): while True: b = str(random.shuffle(b)) if a == b: return True
Are you sure you want to hide this comment? It will become hidden in your post, but will still be visible via the comment's permalink.
Hide child comments as well
Confirm
For further actions, you may consider blocking this person and/or reporting abuse
We're a place where coders share, stay up-to-date and grow their careers.
Here's an O(∞) solution inspired by bogosort. If it halts,
aandbare anagrams.