Lets say I have a set of strings as:
0001
1000
0010
1000
0110
1110
0010
each string represents one schedule..so
the 1st string 0001 would mean nothing for
week1, nothing for week2, nothing for week3
and week4 should have something. I would like
an algorithim where it would show me the least
popular week to choose. So, in this example
week 3 is the most if you sum up the 3rd bit
for each string. So now when I choose a new
string I want to make sure I dont use week3
since weeks 4 and 2 are less populated. I need
the string built for that...
## Deliverables
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Deliverables must be in ready-to-run condition, as follows (depending on the nature of the deliverables):
a) For web sites or other server-side deliverables intended to only ever exist in one place in the Buyer's environment--Deliverables must be installed by the Seller in ready-to-run condition in the Buyer's environment.
b) For all others including desktop software or software the buyer intends to distribute: A software installation package that will install the software in ready-to-run condition on the platform(s) specified in this bid request.
3) All deliverables will be considered "work made for hire" under U.S. Copyright law. Buyer will receive exclusive and complete copyrights to all work purchased. (No GPL, GNU, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site per the coder's Seller Legal Agreement).
## Platform
All Platforms