| TIP: Click on subject to list as thread! | ANSI |
| echo: | |
|---|---|
| to: | |
| from: | |
| date: | |
| subject: | Re: Fastest algorythm for |
Calan wrote:
> Two text files containing simple lists of strings:
> ____________
>
> What is the fastest way in VB6 to compare the two files, and find entries in
> File #2 that are not in File #1? (i.e. "NewEntry#1" and
"NewEntry#2").
>
> I know I can open file #2 and compare each line to all lines in file #1 with
> two nested loops, but there has to be a faster way... right? :-)
>
Hi Calan,
The answer to your question depends on a few things.
1. Are you comparing whole entries or partial matches (ie. would "abc"
match to "abcdefg").
2. How big are the files? 100 entries, 1 million entries, 10 million?
3. Is there some reason not to use a database? (Apart from time, money
and learning curve)
4. Can you use any other technology (such as C or C++ to build a dll)?
I can give you a much more precise answer once I know 1, 2, and 3 above.
Ian
---
þ RIMEGate(tm)/RGXPost V1.14 at BBSWORLD * Info{at}bbsworld.com
---
* RIMEGate(tm)V10.2áÿ* RelayNet(tm) NNTP Gateway * MoonDog BBS
* RgateImp.MoonDog.BBS at 11/5/04 7:43:17 AM
* Origin: MoonDog BBS, Brooklyn,NY, 718 692-2498, 1:278/230 (1:278/230)SEEN-BY: 633/267 270 5030/786 @PATH: 278/230 10/345 106/1 2000 633/267 |
|
| SOURCE: echomail via fidonet.ozzmosis.com | |
Email questions or comments to sysop@ipingthereforeiam.com
All parts of this website painstakingly hand-crafted in the U.S.A.!
IPTIA BBS/MUD/Terminal/Game Server List, © 2025 IPTIA Consulting™.