模版数组 冒泡

template<typename T>  
bool BubbleSort(T * pInput, int nLen)  
{  
    int i = 0;  
    int j = 0;  
    bool bChange = false;  
    T tTemp;  
    if (!pInput)  
        return false;  
    for (i = 0; i < nLen - 1; i++)  
    {  
        bChange = false;  
        for (j = 0; j < nLen - 1 - i; j++)  
        {  
            if (pInput[j] > pInput[j + 1])  
            {  
                tTemp = pInput[j + 1];  
                pInput[j + 1] = pInput[j];  
                pInput[j] = tTemp;  
                bChange = true;  
            }  
        }  
        if (!bChange)  
            break;  
    }  
    return true;  
}