题目要求:输入一组数,以空格隔开。要求用快排按照从小到大的顺序排列并输出。
java实现如下:
import java.util.Scanner;
public class QuickSort
{
/**
* 快速排序
*/
public static void main(String[] args)
{
Scanner str = new Scanner(System.in);
String[] strlist = str.nextLine().split(" ");//这里想获得字符串数组,从而获得输入数值的个数
int[] list = new int[strlist.length];//因为java中数组需要在使用前给定大小,大小从字符串数组获得
for (int i = 0; i < strlist.length; i++)
{
list[i] = Integer.parseInt(strlist[i]);
}
for (int i = 0; i < list.length; i++)
{
System.out.print(list[i] + " ");
}
System.out.println();
//bubbleSort(list);//调用函数对数组进行排序
//insertSort(list);
//selectSort(list);
//mergeSort(list);
quickSort(list, 0, list.length - 1);
for (int e : list)
{
System.out.print(e + " ");
}
}
//快速排序
public static void quickSort(int[] list, int first, int last)
{
if (first < last)
{
int pivotIndex = partition(list, first, last);
quickSort(list, 0, pivotIndex - 1);
quickSort(list, pivotIndex + 1, last);
}
}
public static int partition(int[] list, int first, int last)
{
int pivot = list[first], left = first, right = last;
while (left < right)
{
while (left < right && list[right] >= pivot)
{
right--;
}
list[left] = list[right];
while (left < right && list[left] <= pivot)
{
left++;
}
list[right] = list[left];
}
list[left] = pivot;//将pivot放到正确的位置
return left;//返回pivot元素的正确下标
}
}