c++模板实现冒泡排序

class bu {
public:
    int num = 0;
    bu(int val) {
        this->num = val;
    }
};

template <class T>
void bubble(T* arr, int len) {

    for (int j = 0; j < len; j++)
    {
        for (int i = 0; i < len - j - 1; i++)
        {
            if (arr[i + 1]->num < arr[i]->num) {
                T temp = arr[i];
                arr[i] = arr[i + 1];
                arr[i + 1] = temp;
            }
        }

    }
}


int main() 
{
    bu i1(1), i2(2), i3(3), i4(4), i5(5);
    bu* bus[6] = { &i3, &i2, &i4, &i1 };
    
    for (int i = 0; i < 4; i++)
    {
        printf("[%d]\t", bus[i]->num);
    }
    printf("\n");

    bubble(bus,4);
    
    for (int i = 0; i < 4; i++)
    {
        printf("[%d]\t", bus[i]->num);
    }
    printf("\n");

    return 0;
}

 普通冒泡排序：

void bubble(int* arr,int len) {
    for (int j = 0; j < len; j ++)
    {
        for (int i = 0; i < len - j -1; i ++)
        {
            if (arr[i + 1] < arr[i]) {
                int temp = arr[i];
                arr[i] = arr[i + 1];
                arr[i + 1] = temp;
            }
        }
        
    }
}
void main() {
    int arr[10] = { 1,5,4,9,6,8,7 };
    int len = sizeof(arr) / 4;
    bubble(arr, len);
    for (int i = 0; i < len; i++)
    {
        printf("[%d]\t", arr[i]);
    }
    printf("\n");

}