ArrayList<Double> doubles = new ArrayList<>(); doubles.add(1.0); doubles.add(Double.valueOf(2)); doubles.add(Double.valueOf(3)); doubles.add(Double.valueOf(4)); doubles.add(Double.valueOf(5)); //double[] array={2,4,1,1,3}; for (int i = 0; i <doubles.size(); i++) { int minPos = i; for (int j = i + 1; j < doubles.size(); j++) { if (doubles.get(j) <doubles.get(minPos)){ minPos = j; } } if (doubles.get(i) > doubles.get(minPos)){ if (doubles.get(0)>doubles.get(minPos)){ int a=minPos;//排序后第一个值原来位置的索引 Log.d("+++++++minPos",""+minPos); } double temp = doubles.get(i); doubles.set(i,doubles.get(minPos)); doubles.set(minPos,temp); } } for (int i = 0; i < doubles.size(); i++) Log.d("+++++++array",""+doubles.get(i));
选择排序并且获取排序后第一个值原来位置的索引
猜你喜欢
转载自blog.csdn.net/wei844067872/article/details/88874163
今日推荐
周排行