冒泡算法

class Program

{
static void Main(string[] args)
{
int[] arr = { 8, 15, 16, 11, 99, 4 };
for (int i = 0; i <arr.Length-1 ; i++)
{
for (int j = 0; j <arr.Length-1-i; j++)
{
if (arr[j]<arr[j+1])
{
int t = arr[j];
arr[j] = arr[j+1];
arr[j + 1] = t;
}
}
}
foreach (int a in arr)
{
Console.WriteLine(a);
}
}

}