推 mqazz1:我想用哪個sort應該不是重點 重點應該是在scheduling的方法 11/05 23:39
問題如下:
A server has n custoniers to serve. The time required to serve
customer i is ti. which is known in advance. The waiting time
of customer i is the total time that customer i has to wail
until he is served, i.e., it is the sum of the service times of
all the customers served before i. Our goal is to minimize the
total waiting time
T=Σ(waiting time for customer i). (i: 1 to n)
Given an efficient algorithm for computing the optimal order in which
to serve the customers. Remember to justify why your algorithm is
correct. and to analyze its running time.
請問這樣的題目可以用quick sort解嗎?
還是要用其他的方式解...
有請高手們解答....
鋼溫!!!
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 223.139.214.182