選擇冒泡排序演算法

來源:互聯網
上載者:User

使用冒泡排序

 

代碼

package com.qixin.five;

public class BubbleSort {
public static void main(String[] args) {
int[] array = new int[]{5,1,2,8,4,6,9,7,3,0};
int temp;
System.out.println("原有數組內容:");
printArray(array);

for (int i = 1; i < array.length; i++) {
for (int j = 0; j < array.length-i; j++) {
if(array[j]>array[j+1]){
temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;
}
}
}
System.out.println("從小到大排序後的結果:");
printArray(array);

for (int i = 1; i < array.length; i++) {
for (int j = 0; j < array.length-i; j++) {
if(array[j]<array[j+1]){
temp=array[j];
array[j]=array[j+1];
array[j+1]=temp;
}
}
}
System.out.println("從大到小排序後的結果:");
printArray(array);
}

public static void printArray(int array[]){
for(int i:array){
System.out.print(i+" ");
}
System.out.println("\n");
}
}

 

 

 

使用選擇排序

 

代碼

package com.qixin.five;

public class SelectSort {
public static void main(String[] args) {
int[] array = new int[]{5,1,2,8,4,6,9,7,3,0};
int temp;
System.out.println("原有數組內容:");
printArray(array);
int index;
for (int i = 1; i < array.length; i++) {
index=0;
for (int j = 1; j <= array.length-i; j++) {
if(array[j]>array[index]){
index=j;
}
}
temp=array[array.length-i];
array[array.length-i]=array[index];
array[index]=temp;
}
System.out.println("正序排列數組內容:");
printArray(array);

for (int i = 1; i < array.length; i++) {
index=0;
for (int j = 1; j <= array.length-i; j++) {
if(array[j]<array[index]){
index=j;
}
}
temp=array[array.length-i];
array[array.length-i]=array[index];
array[index]=temp;
}
System.out.println("倒序排列數組內容:");
printArray(array);
}

public static void printArray(int[] array){
for(int i:array){
System.out.print(i+" ");
}
}

}

 

 

 

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.