Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change
 
PerlMonks  

Re^3: Challenge: Fast Common Substrings

by Moron (Curate)
on Apr 04, 2007 at 12:12 UTC ( #608259=note: print w/ replies, xml ) Need Help??


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

I think many people will see this is only an algorithm outline and will take the word "untested" as an approriate hint in that regard. I am multitasking at the moment.

re "enlighten" - I think under the circumstances the most appropriate enlightment I can offer is to improve your lateral thinking In particular I recommend Six Thinking Hats. You would benefit from the insight that you tend to be stuck wearing a black hat (negative logic) and need to learn how to take it off at will and replace it with other forms of thinking when needed. If you need evidence - In your post you say on the one hand you find it difficult to see how I expect it to work and yet you go on to imply an ability to assess its performance when corrected. That's like saying the performance of anything in a category is X without realising the scope you have already accepted for that category, making it impossible to make any sensible such judgement. Conversely, all I am offering is a means to use hashes to solve the problem and I sincerely expect this to perform well when corrected given the pure simplicity of the algorithm and the opportunities it uses to cut out unnecessary iteration. I think you will find that many beginners out there will find it easy enough to correct this code and get a fast-performing result. So why not you, eh? You're clearly not nearly a beginner are you. So what else can it be ... ?

-M

Free your mind


Comment on Re^3: Challenge: Fast Common Substrings
Re^4: Challenge: Fast Common Substrings
by BrowserUk (Pope) on Apr 04, 2007 at 12:27 UTC
      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.

      -M

      Free your mind

        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.


        Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
        "Science is about questioning the status quo. Questioning authority".
        In the absence of evidence, opinion is indistinguishable from prejudice.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://608259]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others musing on the Monastery: (8)
As of 2014-09-18 23:59 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (128 votes), past polls