Hi, thank you for your replies.
Here is an example of my files. Considering that array1 contains the following sentence:
This sentence is stored in array1and array the following sentences:
Thank you for looking on this. This sentence is a test sentence. This sentence is stored in array2 This is an other sentence. All variables are stored in array2
I would like to compare the sentence of array1 with all the sentences of array2 so that my algorithm will extract the longest common subsequence (i.e. This sentence is stored in).
I will try to change the code and make it more efficient as you described above but I would appreciate your help on this.
In reply to Re: Improving script's speed and performance...
by Anonymous Monk
in thread Improving script's speed and performance...
by Anonymous Monk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |