Em Andamento

killer assignment!

GENE ALGORITHM

The problem is an algorithms problem. So please be sure you are conversant and Good with working out Algorithms problems... It is attached in the zip file.

## Deliverables

Submit to me:

1. A printed listing of your program.

2. A printed sample output using the simplest input file I included.

3. An electronic version of your program file(s) Include a README file with compiling

instructions.

Efficiency counts! . I will test the program on large input sets (tens of thousands of genes). This is being submitted to multiple bid requests. The e person with the program that gets the correct answer in the shortest time on the large input set will get a $100.00 bonus.

Extra $30.00 bonus: Make your program also do “anti-chains?? simultaneously. Ask me what this means if you’re interested.

## Platform

Windows 2000

Habilidades: Programação C, Engenharia, Microsoft, MySQL, PHP, Arquitetura de software, Teste de Software, Área de trabalho do Windows

Ver mais: what is a programming algorithm, what is an assignment problem, what is an algorithms, what is an algorithm in programming, what is an algorithm, what is algorithms in programming, what is algorithm in programming, what is a algorithms, what is a algorithm in programming, what are algorithms in programming, what are algorithms, what algorithm means, the assignment problem, test algorithms, sample algorithm problems, programming with algorithms, problems in algorithms, problems.algorithms, problem assignment, php programming problems set, php programming problem set, good algorithms, efficiency of an algorithm, efficiency of algorithms, efficiency of algorithm

Acerca do Empregador:
( 23 comentários ) United States

ID do Projeto: #3010491

Premiar a:

devicode

See private message.

$55.25 USD em 15 dias
(70 Avaliações)
4.7

3 freelancers are bidding on average $72 for this job

andrewlazarev

See private message.

$93.5 USD in 15 dias
(12 Comentários)
3.6
machidalgo

See private message.

$68 USD in 15 dias
(6 Comentários)
3.2