给我一个用C语言编写和调试一个进程调度程序，以加深对进程的概念及进程调度算法的 理解．

好的，下面是一个用C语言编写的进程调度程序的示例代码：

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

typedef struct process {
    int pid;
    int arrival_time;
    int burst_time;
    int priority;
    int turnaround_time;
    int waiting_time;
    int completion_time;
} Process;

int main() {
    int n, i, j;

    printf("Enter the number of processes: ");
    scanf("%d", &n);

    Process* processes = (Process*) malloc(n * sizeof(Process));

    for (i = 0; i < n; i++) {
        printf("Enter the details of the process %d:\n", i + 1);
        printf("PID: ");
        scanf("%d", &processes[i].pid);
        printf("Arrival Time: ");
        scanf("%d", &processes[i].arrival_time);
        printf("Burst Time: ");
        scanf("%d", &processes[i].burst_time);
        printf("Priority: ");
        scanf("%d", &processes[i].priority);
    }

    // Sort processes by arrival time
    for (i = 0; i < n - 1; i++) {
        for (j = i + 1; j < n; j++) {
            if (processes[i].arrival_time > processes[j].arrival_time) {
                Process temp = processes[i];
                processes[i] = processes[j];
                processes[j] = temp;
            }
        }
    }

    int total_time = 0;
    int total_waiting_time = 0;
    int total_turnaround_time = 0;

    printf("\nGantt Chart:\n");

    printf(" ");
    for (i = 0; i < n; i++) {
        printf("| P%d ", processes[i].pid);
    }
    printf("|\n");

    printf("%d", total_time);
    for (i = 0; i < n; i++) {
        while (total_time < processes[i].arrival_time) {
            total_time++;
            printf("    ");
        }

        processes[i].completion_time = total_time + processes[i].burst_time;
        processes[i].turnaround_time = processes[i].completion_time - processes[i].arrival_time;
        processes[i].waiting_time = processes[i].turnaround_time - processes[i].burst_time;

        total_waiting_time += processes[i].waiting_time;
        total_turnaround_time += processes[i].turnaround_time;
        total_time = processes[i].completion_time;

        printf("| P%d ", processes[i].pid);
    }
    printf("|\n");

    float average_waiting_time = (float) total_waiting_time / n;
    float average_turnaround_time = (float) total_turnaround_time / n;

    printf("\nAverage Waiting Time: %f\n", average_waiting_time);
    printf("Average Turnaround Time: %f\n", average_turnaround_time);

    free(processes);
    processes = NULL;

    return 0;
}

这个程序实现了一个简单的先来先服务（FCFS）进程调度算法。用户可以输入要执行的进程数及每个进程的 PID、到达时间、执行时间和优先级，然后程序会根据进程到达时间按从早到晚的顺序排序，然后执行进程调度，并输出 Gantt Chart 和各个进程的等待时间、周转时间和完成时间，最后输出平均等待时间和平均周转时间。