The question was about IsIsogram() at BEST.
Sorting algorithms are O(n) at the best. Also, comparing the sorted letters takes (n-1) operations.
With that, it is still O(n)…
The question was about IsIsogram() at BEST.
Sorting algorithms are O(n) at the best. Also, comparing the sorted letters takes (n-1) operations.
With that, it is still O(n)…