冒泡排序算法

private int[] Bubble(int[] sortData)
        {
            afterSortData = sortData;
            int tempData;
            int remainingLength = afterSortData.Length;
            for (int i = 0; i < afterSortData.Length; i++, remainingLength--)
            {
                for (int j = 1; j < remainingLength; j++)
                {
                    if (afterSortData[j] < afterSortData[j - 1])
                    {
                        tempData = afterSortData[j];
                        afterSortData[j] = afterSortData[j - 1];
                        afterSortData[j - 1] = tempData;
                    }
                }
            }
            return afterSortData;
        }