Hello, i have a difficult problem.
I am trying to make an algorithm that make all occurences of string
Supose we have a word, for example "and"
Then we have a list of string objects...
Ob1=a
Ob2=nd
Ob3=an
How i can find all of replacemen occurences?
Ob1 Ob2
Ob1 n d
Ob2 d
............
There is a known method?
Thank's
Jim