Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses
 
PerlMonks  

Re: Efficient run determination.

by pg (Canon)
on Nov 14, 2002 at 17:34 UTC ( #212935=note: print w/replies, xml ) Need Help??


in reply to Efficient run determination.

I donít think regexp will help improve efficiency in this case. The requirement is very straight forward, and I believe everyone agrees that, any solution has to iterate thru the string (if you use regexp, regexp will do this), doesnít matter how quick or slow it is. Theoretically, in this case, for any reasonably efficient algorithm, including the best solution anyone would be able to find, t ~ o(l) stands true for all solutions (t is the time spent, and the length of the string is l, and t ~ o(l) means t is a linear function of l).

Considering regexp is more general, and most likely would do more than you want in a specific case. It is reasonable that a specific function you wrote would be faster than use regexp.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others examining the Monastery: (9)
As of 2019-06-25 13:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    Is there a future for codeless software?



    Results (106 votes). Check out past polls.

    Notices?