c++实现算法冒泡排序

using namespace std;
void (int *sortList, int number)
{
    int i = 0;
    for (; i <= number; i++)
    {
        cout<<sortList[i]<<" ";
    }
    cout<<endl;
}
void maopao(int * sortList, int number)
{
    int i,j;
    for ( i = 0; i <= number; i++ )
    {
        for ( j = i; j <= number; j++ )
        {
            if ( sortList[j] < sortList[i] )
            {
                int tmp = sortList[i];
                sortList[i] = sortList[j];
                sortList[j] = tmp;
            }
        }
    }
}
int main (int argc, char *argv[])
{
    int sortList[10] = {5, 3, 7, 4, 1, 9, 8, 6, 2, 3};
    int number = 10;
    maopao(sortList,number-1);
    showResult(sortList,number-1);
    return 0;
}