一些算法

    /* 冒泡排序算法 */
    public int[] sort(int[] m)
    {
        int intLenth = m.length;
        /*执行intLenth次*/
        for (int i = 0; i < intLenth; i++)
        {
            /*每执行一次，将最小的数排在后面*/
            for (int j = 0; j < intLenth - i - 1; j++)
            {
                int a = m[j];
                int b = m[j + 1];
                if (a < b)
                {
                    m[j] = b;
                    m[j + 1] = a;
                }
            }
        }
        return m;

    }