java数组基本排序

package day2013_11_8数组排序;

import java.util.Arrays;
import java.util.Random;

public class 排序 {
	public static void main(String[] args) {
		int[] array = new int[20];
		int[] arraySort1 = new int[20];
		int[] arraySort2 = new int[20];
		int[] arraySort3 = new int[20];
		
		//初始化数组array
		Random ran = new Random();
		for(int i = 0;i < array.length;i++){
			array[i] = -50 + ran.nextInt(100);
		}
		System.out.println("array:" + Arrays.toString(array));
		//冒泡排序
		arraySort1 = Arrays.copyOf(array, array.length);
		System.out.println("冒泡排序的结果arraySort1:" + Arrays.toString(bubbleSort(arraySort1)));
		//选择排序
		arraySort2 = Arrays.copyOf(array, array.length);
		System.out.println(Arrays.toString(arraySort2));
		System.out.println("选择排序的结果arraySort2:" + Arrays.toString(selectionSort(arraySort2)));
		
		//插入排序
		arraySort3 = Arrays.copyOf(array, array.length);
		System.out.println(Arrays.toString(arraySort3));
		System.out.println("插入排序的结果arraySort3:" + Arrays.toString(insertSort(arraySort3)));
		
		
		
	}
	//插入排序经典写法
	public static int[] insertSort2(int[] array){
		for(int i = 0;i < array.length;i++){
			int temp = array[i];
			int j;
			for(j = i - 1;j >= 0 && temp < array[j];j--){
				array[j+1] = array[j];
				
			}
			array[j+1] =temp;
			
		}
		return array;
	}
	//插入排序
	public static int[] insertSort(int[] array){
		for(int i = 1;i < array.length;i++){
			int temp = array[i];
			int j;
			for(j = i - 1;j >= 0;j--){
				if(temp < array[j]){
					array[j+1] = array[j];
				}else
					break;
				
			}
			array[j + 1]= temp;
			
		}
		return array;
		
	}
	
	//选择排序
	public static int[] selectionSort(int[] array){
		
		for(int i = 0;i < array.length;i++){
			for(int j = i+1;j < array.length;j++){
				if(array[i] > array[j]){
					int temp = array[i];
					array[i] = array[j];
					array[j] = temp;
					
					
				}
				
			}
		
			
		}
		return array;
		
	}
	
	//冒泡排序
	public static int[] bubbleSort(int[] array){
		for(int i = 0;i < array.length - 1;i++){
			for(int j = 0;j < array.length - i - 1;j++){
				if(array[j] > array[j + 1]){
					int temp = array[j];
					array[j] = array[j+1];
					array[j+1] = temp;
				}
				
			}
			
		}
		return array;
		
	}

}

package day2013_11_8数组排序;

import java.util.Arrays;
import java.util.Random;

public class java系统排序的使用 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		// 调用系统api进行排序
		int[] ary = { 4, 1, 6, 8, 6, 34, 2, 23 };
		Arrays.sort(ary);
		System.out.println(Arrays.toString(ary));

		// 获取格林威治的时间自1970-1-1 00:00
		long time = System.currentTimeMillis();
		System.out.println(time);

		// 通过以下方法获取当前的年份
		long now = System.currentTimeMillis();
		long year = now / 1000 / 60 / 60 / 24 / 365 + 1970;
		System.out.println(year);

		// 排序性能测试
		int[] array = new int[10000];
		Random ran = new Random();
		for (int i = 0; i < array.length; i++) {
			array[i] = ran.nextInt(); // nextInt()内不写参数为整数范围内

		}
		int[] array2 = Arrays.copyOf(array, array.length);
		
		//测试一段代码所需时间
		long start = System.currentTimeMillis();
		Arrays.sort(array);
		long end = System.currentTimeMillis();
		System.out.println(end - start);
		
		long start2 = System.currentTimeMillis();
		排序.insertSort2(array2);
		long end2 = System.currentTimeMillis();
		System.out.println(end2 - start2);
		//比较两数组是否相等
		System.out.println("array2 == array?-->:" + Arrays.equals(array, array2));

		
	}

}