冒泡排序--C++实现

int Bubble_Partition(int arr[],int low,int high)
{ for(int i=low;i<high;i++)
  {if (arr[i]>=arr[i+1])
     swap(arr[i],arr[i+1]);
  }
   return high-1;
}
void BubbleSort(int arr[],int low,int high)
{int k;
 if (low<high)
 { k=Bubble_Partition(arr,low,high);
   BubbleSort(arr,low,k);
 }
 return;
}

int main()
{   int array1[]={2,4,3,6,15,7,9,13,7,34,2};
   int sizearray = sizeof(array1) /sizeof(int);
    //冒泡排序
    int low=0;
    int high=sizearray-1;
    BubbleSort(array1,low,high);
    for(int i=0;i<sizearray;i++)
       cout << array1[i] << endl;
    return 0;
}