News for hackers. Stuff that matters.
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)
Re:Anagram Scoring by geocar on Wednesday February 22, 2017 @01:00AM (#13703390)
It also requires O(k) memory which is certainly larger than L1, causing two stalls instead of one.
Re:Anagram Scoring by wrsh07 on Wednesday February 22, 2017 @11:22AM (#13706620)
In this case, k is 26. Or ASCII value of 'z'. Either way, very cheap.