快速排序

最新推荐文章于 2024-09-12 15:56:42 发布

原创最新推荐文章于 2024-09-12 15:56:42 发布 · 356 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#random #import #string #class

import java.util.*;

public class QuickSort {

public static int partition(int[] r, int low, int high) {
  int pivotkey = r[low];
  while (low < high) {
   while (low < high && r[high] >= pivotkey)
    high--;
   r[low] = r[high];
   while (low < high && r[low] <= pivotkey)
    low++;
   r[high] = r[low];
  }
  r[low]=pivotkey;
  return low;
}

public static void QSort(int[] r, int low, int high) {
  if (low < high) {
   int pos = partition(r, low, high);
   QSort(r, low, pos - 1);
   QSort(r, pos + 1, high);
  }
}

public static void main(String[] args) {
  // TODO Auto-generated method stub
  Random rand = new Random();
  int[] a = new int[10];
  // int i=rand.nextInt(100);
  // System.out.println(i);
  System.out.print("原数列为：");
  for (int i = 0; i < a.length; i++) {
   a[i] = rand.nextInt(100);
   System.out.print(a[i] + " ");
  }
  QSort(a, 0, a.length - 1);
  //QSort(a, 1, a.length);
  System.out.println();
  System.out.print("排序后数列为：");
  for (int i = 0; i < a.length; i++) {
   System.out.print(a[i] + " ");
  }

}