介绍了带有限期作业排序问题的概念,以及使用贪心方法求解此问题的一般算法和一种改进的快速算法。
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.
本文在进一步研究快速排序法和位置计算法的基础上,对位置计算法进行了改进,使程序得到了优化,从而提高了运行效率。通过上机实验,获得满意的效果。
On the further research of quick sort algorithm and position computing algorithm, the latter one is improved and optimized, thus more effective in data processing.
应用推荐