带有限期作业排序快速算法的另一种实现方法

介绍了带有限期作业排序问题的概念，以及使用贪心方法求解此问题的一般算法和一种改进的快速算法。根据改进的快速算法的基本思想，给出了另一种更直观，更易于理解和实现的方法，并分析了此算法在最好、最坏和平均情况下算法的时间复杂性，说明在平均情况下此算法的时间复杂性并不比快速算法的时间复杂性差。

Another Method of Implementing the Fast Algorithm of Job Scheduling with Time Limit

This paper introduces the concept about the question of job scheduling with time limit, a general method of solving this question using greedy method and a fast algorithm which is improved. According to the basic thought of the fast algorithm, the paper gives another kind of method which is visual and easy to be understood and implemented. Meanwhile, the paper analyses the complexity of time of the algorithm in the best, worst and average cases. The result indicates that the complexity of time of this algorithm is not worse than that of the fast algorithm in average cases.