Eliminte prime numbers from array

#include <iostream>
#include <cmath>
using namespace std;
int isPrime(int number);
int main(){
    int numbers[] = {1,2,3,4,5,6,7,8,9,10};

    int numbersLength = sizeof(numbers) / sizeof(int);
    for (int i = 0; i < numbersLength; i++) {
        if ( isPrime(numbers[i])) {
            for (int j = i; j < numbersLength-1; j++){
                numbers[j] = numbers[j+1];
            }
            numbersLength--;
            i--;
        }
    }

    for(int i = 0; i < numbersLength; i++) {
        cout << numbers[i] << " ";
    }
    return 0;
}

int isPrime(int number){
    if(number == 0 || number == 1) return 0;
    if(number == 2) return 1;
    for (int i = 2; i  <= sqrt(number); i++ ){
        if ( number % i == 0) {
            return 0;
        }
    }
    return 1;
}