> 3) The binary search from step 1 indicates where the new > entry should be inserted. To add the entry to the list, > individual entries are moved one at a time (to avoid > overlapping moves) to open a spot in the list for the new entry.
Store the list starting at the end of the memory area. That way you can use one MVCL to move the list down (toward lower addresses) in memory to open the slot for a new entry. That should be much faster than moving every individual entry. Fred! ----------------------------------------------------------------- ATTENTION: The information in this electronic mail message is private and confidential, and only intended for the addressee. Should you receive this message by mistake, you are hereby notified that any disclosure, reproduction, distribution or use of this message is strictly prohibited. Please inform the sender by reply transmission and delete the message without copying or opening it. Messages and attachments are scanned for all viruses known. If this message contains password-protected attachments, the files have NOT been scanned for viruses by the ING mail domain. Always scan attachments before opening them. -----------------------------------------------------------------
