Quick Sort

Quick Sort

1000(ms)

65535(kb)

798 / 4244

Quicksort is a well-known sorting algorithm developed by C. A. R.Hoare that, on average, makes Θ(n log n) comparisons to sort nitems. However, in the worst case, it makes Θ(n²)comparisons. Typically, quicksort is significantly faster inpractice than other Θ(n log n) algorithms, because its inner loopcan be efficiently implemented on most architectures, and in mostreal-world data it is possible to make design choices whichminimize the possibility of requiring quadratic time. Quicksortsorts by employing a divide and conquer strategy to divide a listinto two sub-lists. The steps are: 1. Pick an element, called apivot, from the list. 2. Reorder the list so that all elementswhich are less than the pivot come before the pivot and so that allelements greater than the pivot come after it (equal values can goeither way). After this partitioning, the pivot is in its finalposition. This is called the partition operation. 3. Recursivelysort the sub-list of lesser elements and the sub-list of greaterelements. The base case of the recursion are lists of size zero orone, which are always sorted. The algorithm always terminatesbecause it puts at least one element in its final place on eachiteration (the loop invariant). Quicksort in action on a list of random numbers.The horizontal lines are pivot values. Write a program to sortascending int number by QuickSort ,n less than 50000.

输入

two lows, the first low is numbers , less and equal than 50000. the second low is a set integer numbers

输出

a set integer numbers of sort ascending

样例输入

10
4 2 1 5 7 6 9 8 0 3

样例输出

0 1 2 3 4 5 6 7 8 9

@浅夏沫若 ：code

#include 

using namespace std;

int a[50001] = { 0 };

int n = 0;

void qSort(int low, int high)

{

 if (low > high)

  return;

 int key = a[low];

 int i = low;

 int j = high;

 int temp = 0;

 while (i

 {

  while (a[j]>=key&&i

   j--;

  while (a[i] <= key&&i

   i++;

  if (i < j)

  {

   temp = a[i];

   a[i] = a[j];

   a[j] = temp;

  }

 }

 a[low] = a[i];

 a[i] = key;

 qSort(low, i-1);

 qSort(i+1, high);

}

int main()

{

 cin >> n;

 for (int i = 0; i < n; i++)

  cin >> a[i];

 qSort(0, n-1);

 for (int i = 0; i < n; i++)

  cout << a[i] << " ";

 cout << endl;

 return 0;

}