can anyone help me to implement this algorithm of text watermarking?

1.read text file

2.find no of sentences(NOS)in text file

3. for 1= 1 to NOS, repeat step 4 to 15

4.now=no of words in ith sentence

5.for j=1 to now, repeat step 6 to 15

6.low= length of jth word

7.for k=1 to low, repeat steps 8 to 15

8. sa= letter for comparison/search(kth letter)

9.count=0

10,for m=1 to word length, repeat steps 11 to 13

11.current letter=mth letter of word

12. if (sa=current letter)

count=count+1

13.m=m+1

14.if(count>1)

word(k)= initial letter of kth word

break internal for;

15. k=k+1

16.j=j+1;

17. i=i+1;

output(watermark)

Answer 1

[Walter Roberson]

http://www.mathworks.com/matlabcentral/answers/8026-best-way-s-to-master-matlab