The sorting algorithm can prevent unordered simulation that lead to waste time , which improved the speed of simulation to a certain extent 这种排序算法可以避免无序的模拟而造成的时间浪费，从而在某种程度上提高了模拟速度。
Generic string sort routines . i prefer to use the ' non - pure ' quick sort unless you have a good reason to choose another routine 这是一个普通的串排序例程。我更喜欢使用这个'不纯粹的'快速排序算法，除非你有一个更好的理由来选择其它的例程。
Can be used as the basis of a sort algorithm , and while using a delegate comparison method as the basis of a sort algorithm would be valid , it is not ideal 可用作排序算法的基础，虽然将委托比较方法用作排序算法的基础是有效的，但是并不理想。
Open standards based - the message sorting algorithm , which is a major part of the message queue framework , is implemented in class treeset , a part of the j2me specification 基于开放标准消息排序算法（消息队列框架的主要部分）在treeset类（ j2me规范的一部分）中实现
Moreover , from a global view , the thesis studies the message order problem caused by model and presents a reliable message order algorithm based on sequence . 4 进而，论文从全局角度出发，研究了因异步消息模型而引发的消息排序问题，提出了基于序号的消息可靠排序算法。
String sort routines : quick , merge , sele - generic string sort routines . i prefer to use the ' non - pure ' quick sort unless you have a good reason to choose another routine 这是一个普通的串排序例程。我更喜欢使用这个'不纯粹的'快速排序算法，除非你有一个更好的理由来选择其它的例程。
In chapterl , we introduce basic concepts about scheduling , the worst - case ratio analysis of approximation algorithms , stochastic scheduling problem and classes of stochastic scheduling policies 我们在第一章中首先介绍排序问题的基本概念，排序算法的性能分析，以及随机性排序问题及其排序策略。
The proposed algorithm for knapsack problem is based on mimd . the sort algorithm by sampling is introduced in the sorting stage . the stages of generating subset - sum and searching are also optimized 并行背包算法基于mimd结构,在排序过程中引入基于采样的排序算法,然后对子集和生成和搜索过程加以优化。
Now that we can easily see the difference between files and folders , we can also see that that , in the table view , the default sorting algorithm has ordered them alphabetically - but mixed the folders and files together 现在，可以很容易地看出文件和文件夹之间的区别，我们还可以看到：在表视图中，缺省排序算法按字母顺序给各项排序但将文件夹和文件混在一起。
This paper presents an efficient optimization algorithm and complicated code for airciraft landing scheduling problem , based on depth - first - search implicit emumeration algorithm , subject to mps limiting , position lock limiting and optimization depth limiting 摘要以深度优先搜索的隐枚举算法为基础，结合mps约束、位置冻结限制、优化深度限制，使用复杂的软件编码实现了特定于飞机着陆调度问题的优化排序算法。
