I would think O(n) would be faster because our program is simple and all it’s doing is checking if the word is an isogram and I think it would be faster and more efficient.
I would think O(n) would be faster because our program is simple and all it’s doing is checking if the word is an isogram and I think it would be faster and more efficient.