How to organize an array by placing its elements in different subsets in c?

Question

I want to organize a set of integers by putting primes in one subset. For instance:

Input set:
{2,4,6,7,11,6,3}.

Desired Result:

Basic numbers: {2,7,11,3}.

Not prime numbers: {4,6,6}.

This is my reasonable code that ended up with an absurd result:

#include <stdio.h>
 int main() {
 int i,j,n,a=0,b1=0,b2=0;
 printf(" Enter the number of elements in the set: ");
 scanf("%d",&n);
 int integer[n],nonPrime[n],prime[n];
 for(i=1;i<=n;i++) {
     printf(" Enter #%d element of the set: ",i);
     scanf("%d",&integer[i-1]);
 }
 printf("\n The set is: {");
 for(i=1;i<=n;i++) {
     printf("%d ",integer[i-1]);
 }
 printf("}");
 for(i=1;i<=n;i++) {
     for(j=2;j<=integer[i-1]/2;j++) {
         if(integer[i-1]%j==0) {
             a=1;
             break;
         }
     }
     if(a==1) {
         integer[i-1]=nonPrime[i-1];
         b1++;

     }
     else {
         integer[i-1]=prime[i-1];
         b2++;

     }
 }
 printf("\n Prime numbers: { ");
 for(i=1;i<=b2;i++) {
     printf("%d ",prime[i-1]);
 }
 printf("}\n Non prime numbers: { ");
 for(i=1;i<=b1;i++) {
     printf("%d ",nonPrime[i-1]);
 }
 printf("} \n");

return 0;
}
 //HENG SOK MENG

Output:

 Enter the number of elements in the set: 6
 Enter #1 element of the set: 1
 Enter #2 element of the set: 3
 Enter #3 element of the set: 5
 Enter #4 element of the set: 7
 Enter #5 element of the set: 4
 Enter #6 element of the set: 6

 The set is: {1 3 5 7 4 6 }
 Prime numbers: { 1965421290 1965972381 718360966 32 }
 Non prime numbers: { 2686560 718361022 }

 Process returned 0 (0x0)   execution time : 6.063 s
 Press any key to continue.

Answer 1

I think your logic is a bit wrong. This code shows that your loops can be simplified to for (i = 0; i < n; i++), which will allow indexing more [i]instead [i-1].

isprime(int n) integers[n], .

:

#include <stdio.h>
#include <stdlib.h>

int isprime(int n);

int 
main(void) {
    int n, i, primecnt = 0, nonprimecnt = 0;

    printf("Enter the number of elements in the set: ");
    if (scanf("%d", &n) != 1) {
        printf("Invalid entry\n");
        exit(EXIT_FAILURE);
    }

    int integers[n], prime[n], nonprime[n];

    for (i = 0; i < n; i++) {
        printf(" Enter #%d element of the set: ",i+1);
        if (scanf("%d", &integers[i]) != 1) {
            printf("Invalid entry\n");
            exit(EXIT_FAILURE);
        }
    }

    printf("\n The set is: {");
    for(i = 0;i < n; i++) {
        printf("%d ",integers[i]);
    }
    printf("}");

    for (i = 0; i < n; i++) {
        if (isprime(integers[i])) {
            prime[primecnt++] = integers[i];
        } else {
            nonprime[nonprimecnt++] = integers[i];
        }
    }

    printf("\n Prime numbers: { ");
    for(i = 0; i < primecnt; i++) {
        printf("%d ", prime[i]);
    }
    printf("}\n Non prime numbers: { ");
    for(i = 0; i < nonprimecnt; i++) {
        printf("%d ",nonprime[i]);
    }
    printf("} \n");

    return 0;
}

int
isprime(int n) {
    int divisor;
    if (n < 2) {
        return 0;
    }

    for (divisor=2; divisor*divisor<=n; divisor++) {
        if (n%divisor==0) {
            return 0;
        }
    }
    return 1;
}

Answer 2

, :

• user2052592, = .
• (i) integer[] prime[] nonPrime[], (, 5- ).
  ( b1 nonPrime[] b2 prime[]?)
• a ( a = 1), reset ( a = 0). (. , .)
• , , , . ( j) 1, 2 3.

, .

, :

    for(i=1;i<=n;i++) {
        for(j=2;j<=integer[i-1]-1;j++) {
            if(integer[i-1]%j==0) {
                a=1;
                break;
            }
        }
        if(a==1  || integer[i-1] == 1) {
            nonPrime[b1]=integer[i-1];
            b1++;
        }
        else {
            prime[b2]=integer[i-1];
            b2++;
        }
        a = 0;
    }
    printf("\n Prime numbers: { ");
    for(i=0;i<b2;i++) {
        printf("%d ",prime[i]);
    }
    printf("}\n Non prime numbers: { ");
    for(i=0;i<b1;i++) {
        printf("%d ",nonPrime[i]);
    }
    printf("} \n");

    return 0;
}

, . , , , .

Answer 3

LHS RHS

integer[i-1]=nonPrime[i-1] 
integer[i-1]=prime[i-1]