想请教下大神下面代码的时间复杂度

void sort(){        //冒泡排序
   
    for(int i=0;i<count-1;i++){
        for(int j=0;j<=count-(2+i);j++)
        {
        
            if(number[j]>number[j+1]){
                int temp1 = number[j];
                number[j]=number[j+1];
                number[j+1]=temp1;
               
                string temp2 = name[j];
                name[j]=name[j+1];
                name[j+1]=temp2;
               
                string temp3 = address[j];
                address[j]=address[j+1];
                address[j+1]=temp3;
            }
        }
    }
}

最里面的循环体一共执行 count*(count-1)/2 次，因此它的时间复杂度是 O(n2)

BTW：你这代码好烂啦，函数原型最起码也应该是 void sort( int numbers[], std::string names[], std::string address[], size_t count );
写正常一些的话，应该是
struct people
{
    int number;
    std::string name;
    std::string address;
};
void bubble_sort( people s[], size_t n );