借助人工智能提升 C 代码效率和性能

int main() {
    int arr[] = {5, 2, 8, 3, 1};
    int n = sizeof(arr) / sizeof(arr[0]);

    // 使用传统的 Bubble Sort 算法
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < n - i - 1; j++) {
            if (arr[j] > arr[j + 1]) {
                int temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
            }
        }
    }

    // 使用 AI 优化后的 Bubble Sort 算法
    int iterations = 0;
    int swaps = 0;
    for (int i = 0; i < n - 1; i++) {
        bool swapped = false;
        for (int j = 0; j < n - i - 1; j++) {
            iterations++;
            if (arr[j] > arr[j + 1]) {
                int temp = arr[j];
                arr[j] = arr[j + 1];
                arr[j + 1] = temp;
                swapped = true;
                swaps++;
            }
        }
        if (!swapped) {
            break;
        }
    }

    printf("Iterations: %d\n", iterations);
    printf("Swaps: %d\n", swaps);

    return 0;
}