程序代码：

/*
*单链表插入排序
*/
#include <stdio.h>
#include <stdlib.h>


 struct PCB
{
    char name[10];
    int  rtime;
    int  priority;
    char state;
    struct PCB *next;
};

/*
*初始化PCB
*/
struct PCB *initPCB()
{
  struct PCB *head;

 
  head=(struct PCB *)malloc(sizeof(struct PCB));
  if(NULL==head)
  {
      exit(-1);
  }
  head->next=NULL;

  return head;
}

struct PCB *inputValue(struct PCB *head)
{
  struct PCB *temp;

  temp=head;
  //for(int i=0;i<5;i++)
  //{
    printf("please input the information of process\n");
    printf("name:");
    scanf("%s",temp->name);
    printf("run time:");
    scanf("%d",&temp->rtime);
    printf("priority:");
    scanf("%d",&temp->priority);
    temp->state='R';
    printf("\n");

 // }
  return temp;
}

/*
*找到优先级最高的进程
*/
void  MaxPriorityProcess(struct PCB * head,struct PCB * pCurrent)
{
  struct PCB *temp;
  struct PCB *p;//p为新节点分配内存，temp用来遍历链表

  temp=head->next;
  p=(struct PCB*)malloc(sizeof(struct PCB));
  p->priority=pCurrent->priority;

  while(temp)
  {
      if(pCurrent->priority>temp->priority) //如果大于某个已经存在的节点
      {                                         //则把新节点插入到该节点前面
          p->next=temp->next;
          temp->next=p;
      }
      temp=temp->next;
  }

  p->next=NULL;//如果小于所有已经存在的节点，则执行下面的代码
  head->next=p;//把新节点插入到链表的最后


}

/*
*打印PCB
*/
void printPCB(struct PCB * head)
{
    struct PCB *temp;

    temp=head->next;
    while(temp!=NULL)
    {
        printf("\n process name: %s\n run time: %d\n priority num: %d\n process state:%c\n",
            temp->name,temp->rtime,temp->priority,temp->state);
        temp=temp->next;
    }
    printf("\n");
}

int main()
{
    struct PCB *head=NULL;
    struct PCB *temp=NULL;

    //head=initPCB();
     /*head=(struct PCB *)malloc(sizeof(struct PCB));
     if(NULL==head)
     {
         exit(-1);
     }
     head->next=NULL;
    for(int i=0;i<5;i++)         
    {
      temp=initPCB();  
      //temp->next = NULL;
      MaxPriorityProcess(head,temp);          
    }*/
    head=initPCB();
    for(int i=0;i<5;i++)
    {
      temp=inputValue(head);
      MaxPriorityProcess(head,temp);    
    }
    printPCB(head);             
   
    return 0;
}

程序代码：

// Note:Your choice is C++ IDE
/*
*单链表插入排序
*/
#include <stdio.h>
#include <stdlib.h>

typedef struct PCB
{
    char name[10];
    int  rtime;
    int  priority;
    char state;
    struct PCB *next;
}PCB;

/*
*初始化PCB
*/
PCB *initPCB()
{
  PCB *head;

  head=(PCB *)malloc(sizeof(PCB));
  if(NULL==head)
  {
      exit(-1);
  }
  head->next=NULL;

  return head;
}

/*
*  新建一个节点，并返回
*/
PCB *inputValue()
{
    PCB *temp = NULL;
    
    temp = initPCB();

    printf("please input the information of process\n");
    printf("name:");
    scanf("%s",temp->name);
    printf("run time:");
    scanf("%d",&temp->rtime);
    printf("priority:");
    scanf("%d",&temp->priority);
    temp->state='R';
    printf("\n");

      return temp;
}

/*
*找到优先级最高的进程
*/
void MaxPriorityProcess( PCB * head, PCB * pCurrent)
{
    
    if( head->next == NULL )
    {
        head->next = pCurrent;
        return;
    }
    
    /* 从小到大排 */
    PCB* p = head->next;
    PCB* q = head;        
    while( p != NULL )
    {
        if( (pCurrent->priority) < (p->priority) )
        {
            q->next = pCurrent;
            pCurrent->next = p;
            break;    
        }
        q = p;
        p = p->next;
    }
    q->next = pCurrent;
    
    
  /*PCB *temp;
  PCB *p;//p为新节点分配内存，temp用来遍历链表

  temp=head->next;
  p=(PCB*)malloc(sizeof(PCB));
  p->priority=pCurrent->priority;

  while(temp)
  {
      if(pCurrent->priority>temp->priority) //如果大于某个已经存在的节点
      {                                         //则把新节点插入到该节点前面
          p->next=temp->next;
          temp->next=p;
      }
      temp=temp->next;
  }

  p->next=NULL;//如果小于所有已经存在的节点，则执行下面的代码
  head->next=p;//把新节点插入到链表的最后*/


}

/*
*打印PCB
*/
void printPCB( PCB * head )
{
    PCB *temp;

    temp=head->next;
    while(temp!=NULL)
    {
        printf("\n process name: %s\n run time: %d\n priority num: %d\n process state:%c\n",
            temp->name,temp->rtime,temp->priority,temp->state);
        temp=temp->next;
    }
    printf("\n");
}

int main()
{
    PCB *head=NULL;
    PCB *temp=NULL;

    head=initPCB(); // 头结点为空
    for(int i=0;i<3;i++)
    {
      temp=inputValue();
      MaxPriorityProcess(head,temp);
      printf("=================\n");    
    }
    printPCB(head);             
   
    return 0;
}

程序代码：

/*
*模拟简单的进程调度
*/
#include <stdio.h>
#include <stdlib.h>

typedef struct PCB
{
    char name[10];
    int  rtime;
    int  priorityNum;
    char state;
    struct PCB *next;
}PCB;

/*
*初始化PCB
*/
PCB *initPCB()
{
  PCB *head;

  head=(PCB *)malloc(sizeof(PCB));
  if(NULL==head)
  {
      exit(-1);
  }
  head->next=NULL;

  return head;
}

/*
*  新建一个节点，并返回
*/
PCB *inputValue()
{
    PCB *temp = NULL;
   
    temp = initPCB();

    printf("please input the information of process\n");
    printf("name:");
    scanf("%s",temp->name);
    printf("run time:");
    scanf("%d",&temp->rtime);
    printf("priorityNum:");
    scanf("%d",&temp->priorityNum);
    temp->state = 'R';
    printf("\n");

    return temp;
}

/*
*找到优先级最高的进程
*/
void findProcess( PCB * head, PCB * pCurrent )
{
   
    if( head->next == NULL )
    {
        head->next = pCurrent;
        return ;
    }
   
    /* 从大到小排 */
    PCB* p = head->next;
    PCB* q = head;       
    while( p != NULL )
    {
        if( (pCurrent->priorityNum) > (p->priorityNum) )
        {
            q->next = pCurrent;
            pCurrent->next = p;
            break;   
        }
        q = p;
        p = p->next;
    }
    q->next = pCurrent;
}

/*
*打印PCB
*/
void printPCB( PCB * head )
{
    PCB *temp;

    temp = head->next;
    while( temp!=NULL )
    {
        printf("\n process name: %s\n run time: %d\n priority num: %d\n process state:%c\n",
            temp->name,temp->rtime,temp->priorityNum,temp->state);
        temp = temp->next;
    }
    printf("\n\n");
}

/*
*运行进程
*/
void runProcess( PCB * head,PCB * selected )//选中一进程 优先数减一 运行时间减一 如果运行的时间为0 就将装太改为1 如果不为0 加入队列 重新比较 获得优先数最大进程 依次下去直到
{                                            //所有的进程状态都为E  求实现
    PCB *p,*q;

    while( selected->next != NULL )
    {
         selected->priorityNum--;
         selected->rtime--;

         if( selected->rtime == 0 )
        {
            selected->state = 'E';
            break;
        }
           
        /*将运行时间不为0的进程加入队列*/
         p = head->next;
        q = head;
        if( q == NULL )//空队列
        {
            q = selected; 
        }
          if( (selected->priorityNum) > (p->priorityNum) )
        {
             q->next = selected;
             selected->next = p;
        }
    }

}

int main()
{
    PCB *head = NULL;
    PCB *temp = NULL;

    head = initPCB(); // 头结点为空

    for(int i=0;i<3;i++)
    {
      temp = inputValue();
      findProcess(head,temp);
      printf("=================\n");       
    }
  
    runProcess(head,temp);
    printPCB(head);   
   
    return 0;
}