八大排序算法---插入排序

package suanfa;
//插入排序
public class Charu {
	public void start() {
		int[] arr = {32,52,67,85,77,83,45,84,68,90};
		int mark =0;
		int j =0;
		for(int i=1;i=0;j--) {
				if(arr[j]>mark) {
					//这里用元素后移比交换位置更好
					arr[j+1]=arr[j];
				}else {
					break;
				}
				arr[j]=mark;
			}
			
			for(int a:arr) {
				System.out.print(a+" ");
			}
			System.out.println();
		}
	}
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Charu charu = new Charu();
		charu.start();
	}

}