quote:
ensure that the original set was sufficiently reordered for INST to be helpful.
I was talking about to use INSTR to determine if ONE letter is part of a word. Not entire words. When you test all letters of word 1 against the letters of word 2 then you will know how many times each one is contained in word 2. as long as this is one time, it's an anagram. It would be pretty insane to create an array of all potential permutations, only to compare them.
But maybe I misunderstood the whole thing.
ensure that the original set was sufficiently reordered for INST to be helpful.
I was talking about to use INSTR to determine if ONE letter is part of a word. Not entire words. When you test all letters of word 1 against the letters of word 2 then you will know how many times each one is contained in word 2. as long as this is one time, it's an anagram. It would be pretty insane to create an array of all potential permutations, only to compare them.
But maybe I misunderstood the whole thing.