Quick Sort

#includeiostream
#includecstdlib
#includectime
using namespace std;

void quicksort(int Q[], int left, int right)

{
if (left right)
{
int pivot = Q[(left + right) 2];
int i = left;
int j = right;

while (i = j)
{
while (Q[i] pivot)
i++;
while (Q[j] pivot)
j--;
if (i = j)
{
swap(Q[i], Q[j]);
i++;
j--;
}
}
if (left j)
quicksort(Q, left, j);
if (right i)
quicksort(Q, i, right);
}
}

int main()
{
khai bao bien
#define MAX 10000
int a = 0;
int A[MAX];
srand(time(0));

for (int t = 1;t = MAX;t++)

{
a = rand() % MAX + 1;
A[t] = a;
}

quicksort(A, 1, MAX);

for (int t = 1;t = MAX;t++)

{
cout A[t] ;
}

cout endl;
system(pasue);
 cout endl;
system(pause);
return 0;
}