Qucik Sort

#include <cstdlib>
#include <iostream>

using namespace std;

int swap(int& a, int& b)
{
int temp = 0;
temp = a;
a = b;
b = temp;
}
int QuickSort(int a[], int left, int right)
{
if(left < right)
{
int pivot = a[left];
int i = left+1, j = right;
while( i < j )
{
while(a[i] < pivot)
{ i++;}
while(a[j] > pivot)
{ j--;}
if(i < j)
{swap( a[i], a[j] );}
}
swap(a[left],a[j]);
QuickSort( a, left, j-1);
QuickSort( a, j+1, right);
}
}
int main()
{
int N = 7;
int a[7]={49,38,65,97,76,13,27};
QuickSort( a, 0, N-1 );
for( int k = 0; k < 7; k++ )
cout<< a[k]<<"\t";
system("PAUSE");

}