正在看Siki的C#教程,正好看到委托部分,复习了冒泡排序,就自己写了下:
using System;
using System.Collections.Generic;
namespace ConsoleApp1
{
class Program
{
static void Main(string[] args)
{
List<int> all = new List<int>() { 1, 6, 8, 2, 5, 3, 9, 20 };
int j, temp;
for (int i = 0; i < all.Count - 1; i++)
{
for (j = 0; j < all.Count - 1 - i; j++)
{
if (all[j] > all[j + 1])
{
temp = all[j];
all[j] = all[j + 1];
all[j + 1] = temp;
}
}
}
for (int k = 0; k < all.Count; k++)
{
Console.WriteLine(all[k]);
}
}
}
}
输出结果: