blocks|key|2406988|text|是的，您可以使用Collections.sort()+--这几乎肯定是正确的做法。你至少应该从一开始就这样做，并对其进行基准测试，看看它是否足够快。如果你有更多关于列表的信息，你可能会做得更好(例如，一开始它可能是“基本上排序的”)，但采取简单的方法是一个很好的起点。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|2406989|请注意，您的示例代码与您的描述不符-您已经描述了一个ArrayList<Node>，但您的代码只是用于ArrayList<Integer>。|2406990|entityMap^0|8|I|0|Q|F|1F|I|0^^$0|@$1|2|3|4|5|6|7|J|8|@$9|K|A|L|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|M|8|@$9|N|A|O|B|C]|$9|P|A|Q|B|C]]|D|@]|E|$]]|$1|H|3|-4|5|6|7|R|8|@]|D|@]|E|$]]]|I|$]]

Yes, you can use <code>Collections.sort()</code> - and that's almost certainly the right thing to do. You should at least do that to start with, and benchmark it to see if it's fast enough. You may be able to do better if you have more information about the list (e.g. it's likely to be "mostly sorted" to start with) but taking a simple approach is a good starting point.

Note that your sample code doesn't correspond to your description - you've described an <code>ArrayList&lt;Node&gt;</code> but your code is just for an <code>ArrayList&lt;Integer&gt;</code>.

blocks|key|2407072|text|是的，您可以(也应该)使用Collections.sort()。这种排序方式已经过优化，并且可能总是比您自己编写的实现运行得更快。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2407073|但是，您的代码目前不适用于Collections.sort()。要做到这一点，你放在列表中的对象应该同时有“数据”和“概率”两个字段。|2407074|下面是一个简单的例子：|2407075|public+class+DataProbability+implements+Comparable<DataProbability>+{
++++private+int+data;
++++private+double+probability;

++++public+int+getData()+{
++++++++return+data;
++++}

++++public+double+getProbability()+{
++++++++return+probability;
++++}

++++public+int+compareTo(DataProbability+pProb)+{
++++++++return+Double.compare(getProbability(),+pProb.getProbability());
++++}
}

//+Later,+with+your+list
List<DataProbability>+lDataList+=+new+ArrayList<DataProbability>();
//+Add+some+elements
Collections.sort(lDataList);|code-block|syntax|javascript|2407076|对列表进行排序时，您有两种选择：|2407077|确保要排序的‘|2407078|’实现可比较接口(这是我刚刚使用的比较接口，您也可以在调用Collections.sort()|unordered-list-item|2407079|
时指定要使用的比较器|2407080|2407081|2407082|entityMap^0|0|0|0|0|0|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|X|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Y|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|Z|8|@]|9|@]|A|$]]|$1|F|3|G|5|H|7|10|8|@]|9|@]|A|$I|J]]|$1|K|3|L|5|6|7|11|8|@]|9|@]|A|$]]|$1|M|3|N|5|6|7|12|8|@]|9|@]|A|$]]|$1|O|3|P|5|Q|7|13|8|@]|9|@]|A|$]]|$1|R|3|S|5|6|7|14|8|@]|9|@]|A|$]]|$1|T|3|-4|5|Q|7|15|8|@]|9|@]|A|$]]|$1|U|3|-4|5|6|7|16|8|@]|9|@]|A|$]]|$1|V|3|-4|5|6|7|17|8|@]|9|@]|A|$]]]|W|$]]

Yes, you can (and should) use Collections.sort(). This way of sorting is already optimized, and probably will always run faster than an implementation you are likely to write yourself.

However, your code does not currently apply to Collections.sort(). To do so, the objects you place in your list should have both a 'data' and 'probability' field.

Here's a quick example:

<pre><code>public class DataProbability implements Comparable&lt;DataProbability&gt; {
 private int data;
 private double probability;

 public int getData() {
 return data;
 }

 public double getProbability() {
 return probability;
 }

 public int compareTo(DataProbability pProb) {
 return Double.compare(getProbability(), pProb.getProbability());
 }
}

// Later, with your list
List&lt;DataProbability&gt; lDataList = new ArrayList&lt;DataProbability&gt;();
// Add some elements
Collections.sort(lDataList);
</code></pre>

When sorting a list, you have 2 options:

<ul>
<li>Making sure the 'objects' to be sorted implement the Comparable interface (this is what I just used</li>
<li>Or you can also specify a Comparator to use when calling Collections.sort()</li>
</ul>

blocks|key|2407104|text|在对用户定义的对象进行排序时，需要实现类似的接口。为此，您还需要覆盖equals()和hashcode()方法。但是，对只包含原始数据类型对象的列表进行排序时，这不是必需的。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2407105|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

Comparable interface needs to be implemented when sorting user defined objects. You will also need to override equals() and hashcode() methods for that. However, this is not required for sorting a list which contains only primitive data type objects.

I am writing a java application. I have a class named Node. I have created an ArrayList object and add some nodes in it. , each node has an integer data and a double probability. I want to sort the node in the arrayList increasingly by their probability. I have written the following method:

<pre><code> private void sort(ArrayList&lt;Node&gt; list2) {
 int n = list2.size();
 for (int i = 1; i &lt; n; i++) {
 int m = list2.get(i);
 int j = i - 1;
 while ((j &gt;= 0) &amp;&amp; (list2.get(j).prob &gt; m.prob))
 list2.set(j + 1, list2.get(j--));
 list2.set(j + 1, m);
 }

 }
</code></pre>

But it isn’t a fast method for sorting. How can I sort faster? Can I use the method Collections.sort() in java for this aim? How ? would you please guide me?

help for writing a fast sort

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我正在写一个java应用程序。我有一个名为Node的类。我已经创建了一个ArrayList对象，并在其中添加了一些节点。，每个节点具有整数数据和双倍概率。我想按概率递增地对arrayList中的节点进行排序。我写了以下方法： private void sort(ArrayList<Node> list2) { ...

问帮助编写快速排序
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问帮助编写快速排序EN