排序法

 冒泡排序法

 

for (int a = 0; a < arrayData.Length - 1; a++)
            {
                for (int j = 0; j < arrayData.Length - a - 1; j++)
                {
                    if (arrayData[j] > arrayData[j + 1])
                    {
                        tmp = arrayData[j];
                        arrayData[j] = arrayData[j + 1];
                        arrayData[j + 1] = tmp;
                    }
                }

            }