HRRN算法代码C语言

好的，以下是HRRN算法的C语言代码：

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

struct process {
    int pid; // 进程ID
    int arrival_time; // 到达时间
    int burst_time; // 执行时间
    int waiting_time; // 等待时间
    int turnaround_time; // 周转时间
    float response_ratio; // 响应比
};

int main() {
    int n, i, j;
    float avg_waiting_time = 0, avg_turnaround_time = 0;
    printf("Enter the number of processes: ");
    scanf("%d", &n);
    struct process p[n], temp;
    for (i = 0; i < n; i++) {
        printf("Enter the arrival time and burst time of process %d: ", i + 1);
        scanf("%d%d", &p[i].arrival_time, &p[i].burst_time);
        p[i].pid = i + 1;
        p[i].waiting_time = p[i].turnaround_time = 0;
        p[i].response_ratio = 0.0;
    }
    for (i = 0; i < n; i++) {
        for (j = i + 1; j < n; j++) {
            if (p[i].arrival_time > p[j].arrival_time) {
                temp = p[i];
                p[i] = p[j];
                p[j] = temp;
            }
        }
    }
    int current_time = 0, completed = 0, max_response_ratio_index;
    while (completed != n) {
        float max_response_ratio = -1.0;
        for (i = 0; i < n; i++) {
            if (p[i].arrival_time <= current_time && p[i].burst_time > 0) {
                p[i].response_ratio = (float)(p[i].burst_time + p[i].waiting_time) / p[i].burst_time;
                if (p[i].response_ratio > max_response_ratio) {
                    max_response_ratio = p[i].response_ratio;
                    max_response_ratio_index = i;
                }
            }
        }
        p[max_response_ratio_index].burst_time--;
        current_time++;
        if (p[max_response_ratio_index].burst_time == 0) {
            completed++;
            p[max_response_ratio_index].turnaround_time = current_time - p[max_response_ratio_index].arrival_time;
            p[max_response_ratio_index].waiting_time = p[max_response_ratio_index].turnaround_time - (p[max_response_ratio_index].burst_time + p[max_response_ratio_index].waiting_time);
            avg_waiting_time += p[max_response_ratio_index].waiting_time;
            avg_turnaround_time += p[max_response_ratio_index].turnaround_time;
        }
    }
    avg_waiting_time /= n;
    avg_turnaround_time /= n;
    printf("\nPID\tArrival Time\tBurst Time\tWaiting Time\tTurnaround Time\n");
    for (i = 0; i < n; i++) {
        printf("%d\t%d\t\t%d\t\t%d\t\t%d\n", p[i].pid, p[i].arrival_time, p[i].burst_time, p[i].waiting_time, p[i].turnaround_time);
    }
    printf("Average waiting time: %.2f\n", avg_waiting_time);
    printf("Average turnaround time: %.2f\n", avg_turnaround_time);
    return 0;
}