针对少量记录排序的应用，对直接选择排序算法进行了挖掘，通过增加记忆功能，使算法性能得到明显提高。

This paper discusses an improved algorithm based on selection sorting, which employs stacks to remember previous compared information.

youdao

我们在排序的算法中使用馆藏数据，这样可以聚集读者借书的选择。

We use holdings data in ranking algorithms, which aggregates selection choices of libraries.

youdao

处理器内核选择数据流并执行排序、联接、聚合以及任何复杂的分析算法。

The processor core picks up the data stream and performs sorts, joins, aggregations, and any complex analytic algorithms.

youdao

Just contrast this for a brief moment to something like Selection Sort which from the get go had a ridiculous amount of redundancy comparing the same damn numbers again and again, and again.

这就与其他的排序算法形成了鲜明的对比,比如选择排序,它会一次又一次地做,多余的比较。

哈佛公开课 - 计算机科学课程节选

Blah, try again. How to do this sort.

首先我想说的是被称作选择排序的算法。

麻省理工公开课 - 计算机科学及编程导论课程节选