熱點推薦:
您现在的位置: 電腦知識網 >> 編程 >> 操作系統 >> 正文

十大題型算法全實現——(八)作業調度[2]

2013-11-15 15:49:34  來源: 操作系統 

  int reach_hour;

  int reach_minite;

  int need_time;

  int privilege;

  float excellent;

  int start_time;

  int wait_time;

  int visited;

  }job;

  job jobs[MAXJOB];

  int quantity;

  //初始化函數

  void initial()

  {

  int i;

  for(i=;i

  jobs[i].number=0;

  jobs[i].reach_time=0;

  jobs[i].reach_hour=0;

  jobs[i].reach_minite=0;

  jobs[i].privilege=0;

  jobs[i].excellent=0;

  jobs[i].start_time=0;

  jobs[i].wait_time=0;

  jobs[i].visited=0;

  }

  quantity=0;

  }

  //重置作業數據函數

  void reset()

  { int i;

  for(i=0;i

  jobs[i].start_time=0;

[1]  [2]  [3]  [4]  [5]  [6]  [7]  [8]  [9]  


From:http://tw.wingwit.com/Article/program/czxt/201311/24019.html
    推薦文章
    Copyright © 2005-2013 電腦知識網 Computer Knowledge   All rights reserved.