코드 정렬

 

import java.util.Arrays;

/**
 * @Title: Sort.java
 * @Description:       
 * @author ww
 * @date 2011-10-8   01:48:32
 * @version V1.0
 */
public class DirectSort
{

	public static void main(String[] args)
	{
		int a[] = { 2, 3, 11, 33, 1, 0, 2, 12, 4, 9, 10 };
		System.err.println(Arrays.toString(a));
		for (int i = 1; i < a.length; i++)
		{
			int tmp = a[i], j = i - 1;
			while (j >= 0)
			{
				if (tmp < a[j])
				{
					a[j+1]=a[j];
					a[j]=tmp;
				}
				j--;
			}
		}
		System.err.println(Arrays.toString(a));
	}
}