C++实现选择冒泡快速排序

//排序小结#include<iostream>#include <cstdlib>using namespace std;int n,i,j,temp;int arr[10]={4,8,6,9,1,5,7,3,10,2};//选择排序void select_sort(int arr[],int n){    for(i=0;i<=n-1;i++){        for(j=i+1;j<=n;j++){            if(arr[i]>arr[j])            {                temp=arr[j];                arr[j]=arr[i];                arr[i]=temp;                        }        }}    cout<<"选择排序 ";    for(i=1;i<=10;i++){        cout<<arr[i]<<" ";    }    cout<<endl;}//冒泡排序void bubble_sort(int arr[],int n){    for(i=0;i<=n-1;i++){        for(j=0;j<n-i;j++){            if(arr[j]>arr[j+1])            {                temp=arr[j];                arr[j]=arr[j+1];                arr[j+1]=temp；                }            //cout<<i<<" "<<j<<endl;        }    }    cout<<"冒泡排序 ";    for(i=1;i<=10;i++){        cout<<arr[i]<<" ";    }    cout<<endl;}//快速排序int compare(const void *a,const void *b){    return (*(int *)a-*(int*)b);}void fast_sort(int arr[],int n){    //用Qsort    qsort(arr,10,sizeof(int), compare);    cout<<"快速排序 ";    for(i=1;i<=10;i++){        cout<<arr[i]<<" ";    }    cout<<endl;int main(){    cout<<"未排序  ";    for(i=0;i<=9;i++){cout<<arr[i]<<" ";}    cout<<endl;    //insert_sort(arr,10);    select_sort(arr,10);    bubble_sort(arr,10);    fast_sort(arr, 10);    return 0;}