选择排序

最新推荐文章于 2024-11-07 19:52:43 发布

Qunar_尤雪萍

最新推荐文章于 2024-11-07 19:52:43 发布

阅读量411

点赞数

分类专栏：算法文章标签：排序算法算法

本文链接：https://blog.csdn.net/yxp20092010/article/details/47302099

版权

算法专栏收录该内容

8 篇文章 0 订阅

订阅专栏

选择排序

/**
 * 选择排序
 * Created by xueping.you on 15-8-5.
 */
public class ChooseSort {
    private final static Logger logger = LoggerFactory.getLogger(ChooseSort.class);

    public static void chooseSort(int []unSortArray){
        for(int i=0; i<unSortArray.length; i++){
            int temp = unSortArray[i];
            int smallestIndex = i;
            for(int j=i+1; j<unSortArray.length;j++){
                if(unSortArray[j]<temp){
                    smallestIndex=j;
                    temp=unSortArray[j];
                }
            }
            if(smallestIndex!=i){
                unSortArray[smallestIndex]=unSortArray[i];
                unSortArray[i]=temp;

            }
        }
    }

    public static void main(String []args){
        int [] array = new int[]{12,10,2,45,31,56,1,9};
        logger.info("before:{}", array);
        chooseSort(array);
        logger.info("after:{}",array);

    }

}

result:
19:28:00.208 [main] INFO com.qyou.data.arithmetic.ChooseSort - before:[12, 10, 2, 45, 31, 56, 1, 9]
19:28:00.217 [main] INFO com.qyou.data.arithmetic.ChooseSort - after:[1, 2, 9, 10, 12, 31, 45, 56]