用Java實現簡單選擇排序

來源:互聯網
上載者:User
package ch10;/** * 簡單選擇排序 * @author songjie * */public class SelectSort {public static <T extends Comparable> boolean selectSort(T[] t){if(t==null || t.length <= 1) return true;for(int i = 0; i<t.length-1; i++){int pos = selectMinKey(t, i);T temp = t[i];t[i] = t[pos];t[pos] = temp;}return true;}/** * 返回最小的元素的索引 * @param t * @param start:開始的索引 * @return */private static <T extends Comparable> int selectMinKey(T[] t, int startPos) throws IllegalArgumentException{if(t==null || t.length-1-startPos<=0) throw new IllegalArgumentException("參數傳遞不正確!");int pos = startPos;T min = t[pos];for(int i=pos; i<=t.length-1 ;i++){if(t[i].compareTo(min) < 0){min = t[i];pos = i;}}return pos;}public static void main(String[] args) {Integer[] arr = new Integer[]{1,2,5,7,4,2,3,9,7};SelectSort.selectSort(arr);for(int i : arr){System.out.println(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.