lab2_1_primes.c

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

#define NDEBUG

typedef enum {
    false, true
} bool;

bool prime(int n) {
    return false;
}

int main() {
    int numbers[] = {1, 2, 3, 4, 5, 6, 7, 8, 9};
    bool expected[] = {false, true, true, false, true, false, true, false, false};

    int n = (int) (sizeof(numbers) / sizeof(int));
    for (int i = 0; i < n; i++) {
        assert(prime(numbers[i]) == expected[i]);
    }
    return 0;
}