快速排序（挖坑法）_快速排序--挖坑法 moring sun

快速排序（挖坑法）

#include<iostream>
using namespace std;
void swap(int &a, int &b)
{
 int temp = a;
 a = b;
 b = temp;
}
void quicksort(int a[],int left, int right)
{
 if (left > right)
  return;
 int pivot = a[left];
 int i = left;
 int j = right;
 while (i != j)//先从左向右排
 {
  while (i < j && a[i] < pivot)
  {
   ++i;
  }
  while (i<j && a[j]>pivot)
  {
   --j;
  }
  if (i < j)
  {
       swap(a[i], a[j]);
  }
  
 }
 //a[left] = a[j];
 //a[j] = pivot;
 quicksort(a,left, j - 1);
 quicksort(a,j+1, right);
}
int main()
{
 int n;
 cout << "输入数据个数：" << endl;
 cin >> n;
int* a = new int[n];
 cout << "输入数据：" << endl;
 for (int i= 0; i < n; i++)
 {
  cin >> a[i];
 }
 quicksort(a,0, n - 1);
 for (int j = 0; j < n; j++)
 {
  cout << a[j] << " ";
 }
 return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54