Why is Sort(s1)==Sort(s2) better to use than Counter(s1)==Counter(s2)
<p>Is this considered an efficient way to check if two strings are permutations of eachother? What would be the difference between using two dictionaries instead? Is Counter more optimized for python?</p>

<p>I guess I should clarify, the reason for me posting this is this comment : <a href="https://stackoverflow.com/questions/9623114/check-if-two-unordered-lists-are-equal/9623607#9623607">Check if two unordered lists are equal</a>  mentions that it's more efficient to check if two strings are the same by using sort(s1)==sort(s2).Since this is o(nlog(n)), you would assume Counter would have a better run time.</p>