O(n) is essentially useless for detecting an isogram due to it only having one comparison per letter. O(n2) functions but would be a lot less efficient due to the massive amount of comparisons.
O(n) is essentially useless for detecting an isogram due to it only having one comparison per letter. O(n2) functions but would be a lot less efficient due to the massive amount of comparisons.