当节点被放在CPU调度仿真C程序(SJF)的“队列”中时，如何在链表中按CPU时间对节点进行排序？

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

typedef struct Node {
    int cpuTime;
    struct Node* next;
} Node;

Node* insertNode(Node* head, int cpuTime) {
    Node* newNode = (Node*)malloc(sizeof(Node));
    newNode->cpuTime = cpuTime;
    newNode->next = NULL;

    if (head == NULL || cpuTime <= head->cpuTime) {
        newNode->next = head;
        return newNode;
    }

    Node* curr = head;
    while (curr->next != NULL && cpuTime > curr->next->cpuTime) {
        curr = curr->next;
    }

    newNode->next = curr->next;
    curr->next = newNode;

    return head;
}

void printList(Node* head) {
    Node* curr = head;
    while (curr != NULL) {
        printf("%d ", curr->cpuTime);
        curr = curr->next;
    }
    printf("\n");
}

int main() {
    Node* head = NULL;

    // 假设原始队列中的节点按照CPU时间顺序已经存在
    head = insertNode(head, 5);
    head = insertNode(head, 3);
    head = insertNode(head, 7);
    head = insertNode(head, 1);

    printList(head);  // 输出：1 3 5 7

    return 0;
}