Java排序小演算法(冒泡和選擇)

來源:互聯網
上載者:User

標籤:

package MyTest;import java.util.Scanner;public class BubbleSort {public void Init(int array[]){Scanner num = new Scanner(System.in);System.out.println("請輸入十個數:");for(int i = 0;i<10;i++){array[i] = num.nextInt();}}//列印public void Myprint(int array[]){System.out.println("排序後的結果為:");for(int i = 0;i<10;i++){System.out.print(array[i]+"  ");}System.out.println();}//冒泡排序public void MyBubbleSort(int array[]){int temp;for(int i = 0;i<10;i++){for(int j = 0;j<10-i-1;j++){if(array[j]>array[j+1]){temp = array[j];array[j] = array[j+1];array[j+1] = temp;}}}System.out.println("排序後的結果為:");for(int i = 0;i<10;i++){System.out.print(array[i]+"  ");}System.out.println();}//選擇排序public void MyChoiceSort(int array[]){int temp;for(int i = 0;i<10;i++){for(int j = i+1;j<10;j++){if(array[i]>array[j]){temp = array[j];array[j] = array[j+1];array[j+1] = temp;}}}}//程式入口public static void main(String[] args) {BubbleSort hehe = new BubbleSort();int[] array = new int[10];hehe.Init(array);hehe.MyBubbleSort(array);System.out.print("冒泡排序後");hehe.Myprint(array);hehe.MyChoiceSort(array);System.out.print("選擇排序後");hehe.Myprint(array);}}

  

Java排序小演算法(冒泡和選擇)

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在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.