java简单排序

插入排序：

package com.test.linked;



public class InsertSort {
	public class Array{
		private int[] Myarray;
		private int size;
		public Array(int max){
			Myarray=new int[max];
			size=0;
		}
		/**
		 * 插入数据
		 * @param value
		 */
		public void insert(int value){
			Myarray[size]=value;
			size++;
		}
		public void sort(){
			int out,in;
			for (out = 1; out <size; out++) {
			int	temp=Myarray[out];
			in=out;
			while(in>0&&Myarray[in-1]>=temp){
				Myarray[in]=Myarray[in-1];
				--in;
			}
			Myarray[in]=temp;
			}
			
			}
		/**
		 * 显示数组
		 */
		public void display(){
			System.out.println("array begin");
			for (int i = 0; i < size; i++) {
				System.out.println(Myarray[i]);
			}
		}
	}
	public static void main(String[] args){
		int max=10;
		InsertSort tt=new InsertSort();
		Array test=tt.new Array(max);
		for (int i = 0; i <max ; i++) {
			
			test.insert((int) (Math.random()*87));
		}
		test.display();
		test.sort();
		test.display();
	}
}

数据：

array begin
63
78
43
16
45
84
62
81
57
65
array begin
16
43
45
57
62
63
65
78
81
84

冒泡排序：

package com.test.linked;


public class BoubleSort {
	
	public class Array{
		private int[] Myarray;
		private int size;
		public Array(int max){
			Myarray=new int[max];
			size=0;
		}
		/**
		 * 插入数据
		 * @param value
		 */
		public void insert(int value){
			Myarray[size]=value;
			size++;
		}
		public void sort(){
			for (int i = 0; i < size-1; i++) {
				for (int j = 0; j <size-i-1; j++) {
					if(Myarray[j]>Myarray[j+1]){
						swap(j, j+1);
					}
				}
			}
			
			}
		
		
		/**
		 * 交换数据
		 * @param leftpart
		 * @param rightpart
		 */
		public void swap(int index1,int index2){
			int temp=Myarray[index1];
			Myarray[index1]=Myarray[index2];
			Myarray[index2]=temp;
		}
		/**
		 * 显示数组
		 */
		public void display(){
			System.out.println("array begin");
			for (int i = 0; i < size; i++) {
				System.out.println(Myarray[i]);
			}
		}
	}
	public static void main(String[] args){
		int max=10;
		BoubleSort tt=new BoubleSort();
		Array test=tt.new Array(max);
		for (int i = 0; i <max ; i++) {
			
			test.insert((int) (Math.random()*87));
		}
		test.display();
		test.sort();
		test.display();
	}
}

数据：

array begin
83
41
17
61
53
15
69
26
0
20
array begin
0
15
17
20
26
41
53
61
69
83

选择排序：

package com.test.linked;

public class SelectSort {

	public class Array{
		private int[] Myarray;
		private int size;
		public Array(int max){
			Myarray=new int[max];
			size=0;
		}
		/**
		 * 插入数据
		 * @param value
		 */
		public void insert(int value){
			Myarray[size]=value;
			size++;
		}
		public void sort(){
			int min,out,inner;
			for ( out = 0; out <size-1; out++) {
				min=out;
				for (inner = out+1;  inner<size; inner++) {
					if(Myarray[inner]<Myarray[min]){
						min=inner;
					}
				}
				swap(out, min);
			}
		}
		
		/**
		 * 交换数据
		 * @param leftpart
		 * @param rightpart
		 */
		public void swap(int index1,int index2){
			int temp=Myarray[index1];
			Myarray[index1]=Myarray[index2];
			Myarray[index2]=temp;
		}
		/**
		 * 显示数组
		 */
		public void display(){
			System.out.println("array begin");
			for (int i = 0; i < size; i++) {
				System.out.println(Myarray[i]);
			}
		}
	}
	public static void main(String[] args){
		int max=10;
		SelectSort sort=new SelectSort();
		Array test=sort.new Array(max);
		for (int i = 0; i <max ; i++) {
			
			test.insert((int) (Math.random()*87));
		}
		test.display();
		test.sort();
		test.display();
	}
}

数据：

array begin
42
20
61
39
62
36
42
51
17
52
array begin
17
20
36
39
42
42
51
52
61
62