• Related to the sort operation is how to work through a list of alternative values.

    与排序相关的是如何遍历可选值列表。

    youdao

  • A hash join is usually faster than a sort merge join since there is no sort operation involved.

    哈希连接通常比分类合并连接快,因为它没有涉及到分类操作。

    youdao

  • The in-memory sort operation can be made effective (from storage and computation standpoints) under the fact that each list li is ordered by itself.

    如果每个列表Li由自已排序,那么内存内的排序操作(从存储和计算的角度)可以变得很有效。

    youdao

  • The in-memory sort operation can be made effective (from storage and computation standpoints) under the fact that each list li is ordered by itself.

    如果每个列表Li由自已排序,那么内存内的排序操作(从存储和计算的角度)可以变得很有效。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定