Digitalna evolucija

If A Call X

select two random members
swap them
check the order
if it's sorted exit

 mesec&=-3;
 if (mesec==4) {
 dni=30;
 } else {
 if (mesec==0) {
 dni=28; 
 } else {
 dni=31
 if (mesec==9) dni--;
 }
 }
 

 //The array of zeros
 $dimension sieve[1000]
 
 // up to where primes should be denoted
 $rinvar upto (1,999)
 
 //Output variable is sieve[1000] - upto(1,999) elements of sieve[] array.
 $retvar sieve[]
 
 //The enhanced program should have no more than (2 * original number of lines) + 10 
 $minimize lines on
 
 //Sound when better program is found is ON.
 $sound on
 
 
 //the beginning of the program segment
 two=2;
 index=0;
 sieve[index]=two; // special status of 0
 index=1;
 sieve[index]=two; // special status of 1
 index=0;prim=2;
 arr256[index]=prim;
 
 index=1;prim=3;
 arr256[index]=prim;
 
 index=2;prim=5;
 arr256[index]=prim;
 
 index=3;prim=7;
 arr256[index]=prim;
 
 
 
 
 //Beginning of the enhancing segment. Program lines above, will not be enhanced.
 $bes
 primecandidate=2; //the first or seed prime
 one=1; //one (1)
 
 while (primecandidate<upto) {
 nonprime=primecandidate+primecandidate;
 while (nonprime<=upto) {
 sieve[nonprime]=one;
 nonprime=nonprime+primecandidate;
 }
 primecandidate++;
 }
 //End of the enhancing segment.
 $ees
 

 
 
 // The algorithm has been enhanced for 81.0648%
 
 $DIMENSION sieve[1000]
 $MINIMIZE LINES 128
 $SOUND ON
 $RINVAR upto(1,999) 
 $RETVAR sieve[]
 
 // int sieve[1000]; int arr256[256];int two=0;int index=0;int prim=0;int primecandidate=0;int one=0;int upto=0;int nonprime=0;int critticall1=0;int critticall2=0;int critticall3=0;int critticall4=0;
 
 two=2;
 index=0;
 sieve[index]=two;
 index=1;
 sieve[index]=two;
 index=0;
 prim=2;
 arr256[index]=prim;
 index=1;
 prim=3;
 arr256[index]=prim;
 index=2;
 prim=5;
 arr256[index]=prim;
 index=3;
 prim=7;
 arr256[index]=prim;
 $BES
 one=1;
 nonprime=two+two;
 while (nonprime<=upto) {
 sieve[nonprime]=one;
 nonprime=nonprime+two;
 }
 nonprime=index*index;
 while (nonprime<=upto) {
 primecandidate=nonprime/index;
 sieve[nonprime]=one;
 nonprime=nonprime+index;
 nonprime=nonprime+index;
 primecandidate++;
 while (nonprime<=upto) {
 sieve[nonprime]=one;
 nonprime=nonprime+index;
 nonprime=nonprime+index;
 }
 primecandidate++;
 nonprime=primecandidate*primecandidate;
 while (nonprime<=upto) {
 sieve[nonprime]=one;
 nonprime=nonprime+primecandidate;
 nonprime=nonprime+primecandidate;
 }
 primecandidate++;
 primecandidate++;
 nonprime=primecandidate*primecandidate;
 index=primecandidate;
 if (nonprime<upto) {
 sieve[nonprime]=one;
 primecandidate=primecandidate+index;
 nonprime=nonprime+primecandidate;
 }
 }
 $EES