蓝桥杯基础-017-Array_Sort

题意

输入整数 n

接着输入int[ n ]

输出升序排序后的int[ n ] 

如

5

1 2 4 -5 -8

-8 -5 1 2 4

 

代码

 

import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner keyin = new Scanner(System.in);
		int n = keyin.nextInt();
		int[] input_array = new int[ n ];
		while( n-- > 0){
			input_array[n] = keyin.nextInt();
		}
//		selectSort(input_array);
		bubble(input_array);
		showArray(input_array);
	}
	public static void showArray(int[] src){
		for (int i = 0; i < src.length; i++) {
			System.out.print( src[i] );
			if( i != src.length - 1)
				System.out.print(" ");
		}
		System.out.println("");
	}
	public static void selectSort(int[] src){
		for (int i = 0; i < src.length; i++) {
			int sub_min = i;
			for (int j = i + 1; j < src.length; j++) {
				if( src[sub_min] > src[j]){
					sub_min = j;
				}
			}
			if( sub_min != i ){
				src[ i ] ^= src[ sub_min ];
				src[ sub_min ] ^= src[ i ];
				src[ i ] ^= src[ sub_min ];
			}
		}
	}
	public static void bubble(int[] src){
		for (int i = 0; i < src.length - 1; i++) {
			for (int j = src.length - 1; j > i; j--) {
				if (src[i] > src[j]) {
					src[i] ^= src[j];
					src[j] ^= src[i];
					src[i] ^= src[j];
				}
			}
		}
	}

}

 

 

 

 

 

Summary

1.选择排序法（selectSort）-> 选择后方最小 与 src[ 0 ] 交换

2.冒泡排序法（bubbleSort）