Java选择排序算法

package com.niit;

import java.util.Random;

public class SelectSort
{

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		Random random = new Random();
		int values[] = new int[10];
		System.out.println("未排序前的数组:");
		for (int i = 0; i < values.length; i++)
		{ 
			// 随机生成10个排序数
			int a = random.nextInt(100);
			values[i] = a;
			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[])
	{
		for (int i = 0; i < values.length; i++)
		{
			for (int j = i; j < values.length; j++)
			{
				if (values[j] < values[i])
				{
					int a = values[j];
					values[j] = values[i];
					values[i] = a;
				}
			}
		}
	}

}