Re:Anagram Scoring
by wrsh07 on Tuesday February 21, 2017 @06:53PM
(#13701433)
Sorting is O(kn) where k is the largest number. (See radix sorting)
[ Parent
| on HN ]
It also requires O(k) memory which is certainly larger than L1, causing two stalls instead of one.