最初学习了的冒泡排序(C#)

for (int i = 0; i < numbers.Length - 1; i++)

{
     for (int j = 0; j < numbers.Length - 1 - i; j++)
     {
          if (numbers[j] > numbers[j + 1])
           {
                 int temp = numbers[j];
                 numbers[j] = numbers[j + 1];
                 numbers[j + 1] = temp;
            }
        }
}

posted @ 2012-09-11 15:14  星博  阅读(120)  评论(0)    收藏  举报