冒泡排序

        假设有一整形数组num，长度n;

        bool bFlag=true;
        int temp;
        for (int i = 0; i < n-1&&bFlag; i++)
        {
            bFlag = false;
            for (int j = 0; j < n- i-1; j++)
            {
                if (num[j] > num[j + 1])
                {
                    temp = num[j];
                    num[j] = num[j + 1];
                    num[j + 1] = temp;
                    bFlag = true;
                }  
            }
        }