Posted by DaRKFoRCe on 2000-03-10
-----BEGIN PGP SIGNED MESSAGE----- Hi, Thursday, March 09, 2000, 4:11:46 AM, you wrote: tgoa> Date: Tue, 7 Mar 2000 20:46:01 -0800 (PST) tgoa> From: John Lenz <wuzzeb@xxxxx.xxx> tgoa> Subject: Various Questions for Visual Basic and C/C++ tgoa> Hi. I have a couple of questions(3). >snipped... tgoa> Internet with color codes in it. A function that tgoa> would convert the string to rich text format might be tgoa> another solution, but I don't know rich text format. Do you have MS-VC? If you do, the RTF specs can be found on Help Workshop's help file. If you don't have it, and interested on the RTF solution, mail me privately. >snipped... tgoa> What would be the fastest lookup table. A binary tree tgoa> turns into an expensive linear search when the input tgoa> is already in alphabetical order. The input is coming tgoa> from a file that will be written to when the program tgoa> is finished, so if I balanced the binary tree and then tgoa> had the program write in the same order it would read tgoa> the next time, I could avoid the problem. I was just tgoa> wondering if there was a faster and more efficient way tgoa> of handling a large lookup table. A suggestion, visit this URL : http://members.xoom.com/thomasn/s_man.htm There you can find discussions about sorting & searching algorithms. DaRKFoRCe darkforce@xxxxxxxxxxx.xxx -----BEGIN PGP SIGNATURE----- iQEVAwUAOMf/j55aDG9SPlWxAQHyrQf/QQn9wZg2o8zqE4pEaV0eSONrsv353H6g 2jyBtqFpeYGhbMoeVA4uW8nGS6sbHzYRgdBHt/DK72MH11QHsC+WXS505w8JhcFQ MHqcExrp5CSywklmG2DPex63/Jji1QRr0Y1C4lS8XiAiR5olShlxnSwag4b8nq2e EViQqWTNVEeuUmhfZf1mrPJc8cMJzwVhtrhMU2ahcx9hILvLHq2ZsWDN3TWZ1BsW Fo4zdXuZrlXiwCv0GfXF74a474xFA6eKg4oTj41iE2rmt939k9msc8sQpqPAENWN drfpZtcpMJb93WCcY7fEC7GPhgmPSsprFSK+8p8VRhB3HLtwGO0Nrg== =/8TI -----END PGP SIGNATURE----- To signoff send a mail to listserver@xxxx.xx.xx with "signoff tcg" in the body of your message.
Previous post | Next post | Timeline | Home