find sum of two primes, fxp, m1o2, elsf.net m1j2, miky

#include <stdio.h>
#include <conio.h>
#include <math.h>

int isPrime( int n ){

    int stop = sqrt( n );
    int index = 2;

    for( ; index <= stop; ++index )
        if( (n%index) == 0 )
            return 0;
    return 1;
}

void printAsPrimeSum( int n ){

    int middle = n/2;
    int found = 0;

    for( ; 0 == found && middle > 0; --middle )
        if( isPrime( middle ) && isPrime( n - middle ) ){

            printf(" %d = %d + %d\n", n, middle, n - middle );
            found = 1;
        }
}


int main( int argc, char *argv[] ){

    int index = 2;

    for( ; index < 1001; ++index )
        printAsPrimeSum( index );

    getch();
    return 0;
}