Hi J programmers I need help to discover the most efficient way of doing the following :-
I have two tables, on of n three-character items, and a second of m six-character items such as… abc,def,ghi abceee,defabc,mmmxxx,abcdef,ghidef I need to know which six-character items can be composed of any two concatenated three-character items, so in the above example the required output would be defabc,abcdef,ghidef There may be many thousands of entries in each tables, so an efficient algorithm is required! Thanks in advance Richard Donovan ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
