Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re: TIMTOWTDI and other languages

by samtregar (Abbot)
on Apr 28, 2002 at 21:52 UTC ( #162716=note: print w/ replies, xml ) Need Help??


in reply to TIMTOWTDI and other languages

If I were doing it in C I think I would probably sort both arrays and then walk them in tandem knowing that since they were sorted I would never have to look back into either. Reaching the end of either array would mean completion since no more matches could exist. I'm too lazy to do up the example but I bet it wouldn't be more than 5 or 6 lines of code.

-sam


Comment on Re: TIMTOWTDI and other languages

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (5)
As of 2014-12-27 13:03 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    Is guessing a good strategy for surviving in the IT business?





    Results (177 votes), past polls