Re^5: Challenge: Fast Common Substrings

[Moron]

in reply to Re^4: Challenge: Fast Common Substrings
in thread Challenge: Fast Common Substrings

I haven't even tried! Come on don't be silly -believe me when I say that there are enough beginners who can make it work. My offering is kindergarten stuff. I am not claiming it to be tricky or anything (at least not in this post ;)). I really don't have the time to dream up something more wicked right now or to test it. Nevertherless this first idea has the merit of simplicity. I'll try to have a tested version published by play-off time but i really don;t expect it to be a proposition from Wittgenstein or something! Surely you can see that this is a simple algorithm being implied.

[BrowserUk]

I haven't even tried!

But you expect us to?

And then, how come the code in your original post has changed markedly, and without acknowledement, since I replied to it? As has the text of your previous post. You dissemble, Sir. You dissemble. Let that be an end to it.

[Moron]

It will change again believe me! Why? You imply you already know why - Filed under "troll"!! Oh, never mind then.