數組排序,php數組排序

來源:互聯網
上載者:User

數組排序,php數組排序


    //冒泡排序法public static Date[] bubbleSort(Date[] date){Date d;for(int i =date.length-1; i > 0; i--){for(int j =0; j <= i-1; j++ ){if(date[j].compare(date[j+1])>0){d = date[j];date[j] = date[j+1];date[j+1] = d;}}}return date; //選擇排序法public static void selectionSort(int[] a){int k,temp;for(int i = 0;i < a.length;i++){k = i;//外層每次迴圈都重新賦值*for(int j = i+1; j < a.length; j++){if(a[i] > a[j]){k = j;//發現更小的時,記錄下標值}}//內層迴圈結束時,判斷是否有下標改變,如改,則交換if(i != k){temp = a[i];a[i] = a[k];a[k] = temp;}}}

 

聯繫我們

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