使用openMP实现循环中的数组操作并行化

cfor (int i = 0; i < N; i++) {
    C[i] = A[i] + B[i];
}

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

int main() {
    int N = 1000000; // 数组大小
    double *A, *B, *C;

    // 动态分配内存
    A = (double*)malloc(N * sizeof(double));
    B = (double*)malloc(N * sizeof(double));
    C = (double*)malloc(N * sizeof(double));

    // 初始化数组 A 和 B
    for (int i = 0; i < N; i++) {
        A[i] = i * 1.0;
        B[i] = i * 2.0;
    }

    // 使用 OpenMP 并行化循环
    #pragma omp parallel for
    for (int i = 0; i < N; i++) {
        C[i] = A[i] + B[i];
    }

    // 验证结果（可选）
    // 例如，检查前几个元素
    for (int i = 0; i < 10; i++) {
        printf("C[%d] = %f
", i, C[i]);
    }

    // 释放内存
    free(A);
    free(B);
    free(C);

    return 0;
}

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

int main() {
    int N = 1000000;
    double *A, *B, *C;
    double threshold = 500000.0;

    A = (double*)malloc(N * sizeof(double));
    B = (double*)malloc(N * sizeof(double));
    C = (double*)malloc(N * sizeof(double));

    // 初始化数组
    for (int i = 0; i < N; i++) {
        A[i] = i * 1.0;
        B[i] = i * 2.0;
    }

    #pragma omp parallel for
    for (int i = 0; i < N; i++) {
        if (A[i] > threshold) {
            C[i] = A[i] + B[i];
        } else {
            C[i] = A[i];
        }
    }

    // 验证结果（可选）

    free(A);
    free(B);
    free(C);

    return 0;
}