当前位置: 代码迷 >> 综合 >> java 算法面试 冒泡排序
  详细解决方案

java 算法面试 冒泡排序

热度:80   发布时间:2024-02-28 05:17:28.0
class test {//冒泡public static void main(String[] args) {int a[] = {5,6,8,2,34,345,73,234,656,87,956};for(int i=0;i<a.length;i++){for (int j=0;j<a.length;j++){if(a[i] < a[j]){int b = a[i];a[i] = a[j];a[j] = b;}}}//简单选择for(int i = 0;i < a.length;i++){int min = i;for(int j = i + 1;j < a.length;j++){if(a[j] < a[i]){min = j;}}//进行交换if(min != i){swap(a,min,i);}}for(int i=0;i<a.length;i++){System.out.println(a[i]);}}
}