I need someone to help me with my schools project. The problem goes like this:
Suppose you have a set of numbers from 0 to 16 777 215 (it’s a 3 byte number) and a sub-set of 65536 numbers. I need a program (with source code and full information about the code) which would detect what numbers from a bigger set is in the sub-set.
Detection information is a piece of information which shows which numbers from a bigger set is in the sub-set and which are not. The only problem is that “detection information’s?? size must be around 32K (+/-1K).
Please do not post bids unless you can explain how this program works.
P.S. The program must be written in Delphi or TurboPascal.
Note: Please do not be disappointed about the prize for this projet. This is only the first project in a row of mathematical based programs (like this one) which will help me to choose the right coder(s) for my further normal prized projects. I just want to be sure that I am cooperating with right coders for these jobs.
The further explanation about the project:
Suppose you have two sets:
-set1=[1,2,3,4,5,6]
-set2=[2,3,6]
My firts idea was to mark all elements of set1
(mark with "0" if the element is not in set2 and
mark with "1" if the element IS in set2). In this
case, the detection information would look like this:
DetInf=[0,1,1,0,0,1].
I hope that you can see that this DetInf is too big.
In my project the set1 have 16,777,216 elements, so
the DetInf would be (in this case) 2MB.
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. 2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request. 3) Complete ownership and distribution copyrights to all work purchased.
## Platform
All Windows OS.