i am tring to find anagrams of sequence of words from input, at least two words will be given up to ten word, i also need to do it in O(nlgn) run time, so i was thinking to try: 1. hash table. 2. using an array and then str compare. 3. again using an array qsort it and the char compare and str compare. 4. again using an array but this time using another 2d array to compare the chars given.
do you guys think i an on the right direction? if not i would like to hear another ways to solve that. thanks.
