Delphi / Asm List Compare

Hi, I'd like a function written in Delphi and/or x86 Assembler which takes two Delphi strings, S1 and S2, and creates a third string (S3, or Result). S1 and S2 are binary strings of any length, such that each 4-bytes inside of them contain a Cardinal (DWORD) value from 0 to 2^32. In S1 and S2, the values are ordered, for example, S1 might contain $00000001, $00000003, $000000FF, etc. and S2 might contain $000000FD, $000000FE, $000000FF, etc. I need the function to create S3 containing the result of Cardinal (DWORD) matches between S1 and S2. Since S1 and S1 might be several Megabytes (MB) in size each, a linear search will be too slow. I need an optimized algorithm which should probably use Binary Search to see if a value that exists in S1 also exists in S2. ## Deliverables Just the source code of the function described in the description. * * *This broadcast message was sent to all bidders on Tuesday Sep 4, 2007 10:08:45 PM: Hi Everyone -- after deep thought I'm going to choose 2 bidders. I want you to understand that everyone had good comments and/or a good background/profile/coder bio, so I'm sad that I can't choose you all (I'm not Bill Gates! :-) ). (Note, you'll also get this message if you are one of the chosen coders -- I'm sending this message to all bidders before I choose the two...) I did some jobs as a coder a long time ago on an open coder auction web site, so I know how frustrating it can be at times... You guys are all very good -- just know that. That, and I hope all goes well in your future programming endeavors. I know it will. Peter ## Platform Delphi 2,3,4,5,6,7,8,2005,2006,2007 under Win32 (95, 98, ME, 2000, XP, Server '03, Media Center 05, Vista, ?)