xmlagg函数使用ORDER BY子句对组内元素进行排序。

XMLAGG functions use the ORDER BY clause to sort the elements within the group.

youdao

在本文中，我们已经展示了在WebSphere Process Server内使用事件排序的配置和运行时的特点。

In this article, we have demonstrated the configuration and runtime characteristics of using event sequencing in WebSphere Process Server.

youdao

通过拖拉项目然后在优先级分组内为 它们排序，来反映这种级别。

You reflect this ranking by dragging the items to order them within their priority grouping.

youdao

And that's the kind of instinct I'd like you to get into thinking about. So the answer here is no.

所以答案是否定的,好的，那我们能在线性时间内排序么？

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

Once I have it sorted I can search it in log n time, but that's still isn't as good as just doing n. And this led to this idea of amortization, which is I need to not only factor in the cost, but how am I going to use it?

一旦对其完成排序,就可以在log，n的时间内对其完成搜索,但是这样做仍然不如n的复杂度,这样做引出了耗时分摊的想法,这时不仅需要考虑耗时的因素？

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

And then one of the things that I suggested was that if we could figure out some way to order it, and in particular, if we could order it in n log n time, and we still haven't done that, but if we could do that, then we said the complexity changed a little bit.

这就涉及到了排序,如果可以想出一种来将其进行排序,甚至可以在n，log，n的时间内完成,虽然目前我们没做这件事,但是一旦开始做这件事,那么复杂性就是发生一些变化。

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