快速排序

#include
using namespace std;
 
int partition(int list[], const int low, const int high);
void quicksort(int list[], const int left, const int right);
 
int main()
{
 int list[20]={12,1,4,5,9,2,4,7,5,2,3,49,75,15,12,35,54,78,65,265};
 quicksort(list,0,20);
 for(int i=0;i<20;i++)
 {
  cout< }
 cin>>list[1];
 return 0;
}
 
int partition(int list[], int low, int high)
{
 int pointpos = low;
 int point = list[low];
 for(int i=low+1; i<=high; i++)
 {
  if(list[i]  {
   swap(list[pointpos],list[i]);                 
  }
 } 
 swap(list[low],list[pointpos]);
 return pointpos;   
}
 
void quicksort(int list[], const int left, const int right)
{
 if (left < right)
 {
  int pointpos;
  pointpos = partition(list, left, right);
  quicksort(list, left, pointpos-1);
  quicksort(list, pointpos+1, right);              
 }     
}