2017-12-01 17:26

案一:

int[] array = {2,3,6,9,0,10,5,1,8,7,4};
  Arrays.sort(array); //JDK内置升序函数

方案二:冒泡排序

int[] array = {2,3,6,9,0,10,5,1,8,7,4};        for (int i = 0; i <array.length ; i++) {            for (int k = i+1; k <array.length ; k++) {//从一个数字开始,将数字与余下数字逐一比较大小
                if (array[i]>array[k]){//将小的换到前面,直到最小的换至最前面
                    int m = array[i];                    array[i] = array[k];                    array[k] = m;
                }
            }
        }


评论

kvc636757024

#1

kvc636757024

http://v.qq.com/x/search/?q=%E5%8D%8E%E7%BA%B3%E5%AE%A2%E6%9C%8D%E5%BE%AE%E4%BF%A1_18183615678 http://v.qq.com/x/search/?q=%E5%8D%8E%E7%BA%B3%E5%A8%B1%E4%B9%90%E5%AE%A2%E6%9C%8D_18183615678 http://v.qq.com/x/search/?q=%E5%8D%8E%E7%BA%B3%E5%AE%98%E7%BD%91%E5%BC%80%E6%88%B7_18183615678 http://v.qq.com/x/search/?q=%E7%BC%85%E7%94%B8%E5%8D%8E%E7%BA%B3%E5%AE%98%E7%BD%91%E5%BC%80%E6%88%B7_18183615678 http://v.qq.com/x/search/?q=%E6%AD%A3%E8%A7%84%E5%8D%8E%E7%BA%B3%E5%BC%80%E6%88%B7_18183615678 http://v.qq.com/x/search/?q=%E5%8D%8E%E7%BA%B3%E5%BC%80%E6%88%B7QQ_18183615678 http://v.qq.com/x/search/?q=%E5%8D%8E%E7%BA%B3%E5%AE%A2%E6%9C%8D%E5%BC%80%E6%88%B7_18183615678 http://v.qq.com/x/search/?q=%E5%8D%8E%E7%BA%B3%E5%BC%80%E6%88%B7%E5%BE%AE%E4%BF%A1_18183615678 http://v.qq.com/x/search/?q=%E5%8D%8E%E7%BA%B3%E5%B9%B3%E5%8F%B0_18183615678 http://v.qq.com/x/search/?q=%E5%8D%8E%E7%BA%B3%E5%AE%9E%E4%BD%93%E5%BC%80%E6%88%B7_18183615678
2020/06/26 14:10回复