Java使用快速排序法对数组从小到大排序

给定值的快速排序`

import java.util.*;
public class Program_kuaipai 
{
	
	public static void main(String[] args) 
	{
		String str = "12 34 1 -5 9 100 55 0";
		String[] numStrs = str.split(" ");
		int[] numArray = new int[numStrs.length];
		for(int i=0;i0) 
		{
			quickSort(numArray,0,numArray.length-1);
		}
	}
	private static void quickSort(int[] numArray,int left,int right)
	{
		if(left>right)
		{
			return;
		}
		int i=left;
		int j=right;
		int sentry=numArray[left];//找一个“哨兵”
		//int sentry=numArray[(i+j)/2];
		while(isentry)//从右向左找一个比“哨兵”小的值
			{
				j--;
			}
			while(i

可输入值的快速排序：

import java.util.*;
public class Program_kuaipai
{
	
	public static void main(String[] args) 
	{
		Scanner scan = new Scanner(System.in);
		String str = scan.nextLine();//输入需要排序的数字
		String[] numStrs = str.split(" ");
		int[] numArray = new int[numStrs.length];
		for(int i=0;i0) 
		{
			quickSort(numArray,0,numArray.length-1);
		}
	}
	private static void quickSort(int[] numArray,int left,int right)
	{
		if(left>right)
		{
			return;
		}
		int i=left;
		int j=right;
		int sentry=numArray[left];//找一个“哨兵”
		while(isentry)//从右向左找一个比“哨兵”小的值
			{
				j--;
			}
			while(i