Java冒泡排序算法

package com.niit;

//冒泡排序
public class BubbleSort
{
	// 定义一个乱序数组
	public static void main(String[] args)
	{
		int[] values =
		{ 1, 5, 6, 8, 3, 9, 4, 7, 6, 0, 2 };
		System.out.println("未排序前的数组:");
		for (int i = 0; i < values.length; ++i)
		{

			System.out.print( values[i]+"  ");
		}
		sort(values);
		System.out.println();
		System.out.println("冒泡排序后的数组：");
		for (int i = 0; i < values.length; ++i)
		{

			System.out.print( values[i]+"  ");
		}
	}

	public static void sort(int values[])
	{
		int temp;
		for (int i = 0; i < values.length; i++)
		{
			for (int j = 0; j < values.length - i - 1; j++)
			{
				if (values[j] > values[j + 1])
				{
					temp = values[j];
					values[j] = values[j + 1];
					values[j + 1] = temp;
				}
			}
		}
	}
}