So I'm trying to come up with a algorithm to find words with a specific char/letter in an array of strings.
If I want words with vowel e, I would get word apple and hello from below set.
{apple, bird, hello}
To find words with specific character, will I need to look through all of the letters in the array and look through every character of each word?
Is there a clever way maybe by sorting the list and then searching somehow?
Also, what would be the running time of this algorithm? Will it be considered as O(n) or O(n*m)? Where n is the number of words in the dictionary and m is the length of each word in the array.
Is there a clever wayWould you prefer answers from .net ?