using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
namespace 冒泡排序
{
class Program
{
/// <summary>
/// 冒泡排序,给定一组数据1,12,23,8,5,20,按照倒序排序(从大到小)
/// </summary>
/// <param name="args"></param>
static void Main(string[] args)
{
int[] sums = { 1, 12, 23, 8, 5, 20 };
for (int i = 0; i < sums.Length - 1; i++) //总共要比较的趟数
{
for (int j = 0; j < sums.Length - 1 - i; j++) //每趟中要比较的次数
{
if (sums[j] < sums[j + 1]) //判断两个数值的大小,若前一项比后一项大,则交换位置
{
int temp = sums[j];//定义一个中间量temp
sums[j] = sums[j + 1];
sums[j + 1] = temp;
}
}
}
Console.Write("使用冒泡排序后得到的顺序为:");
for (int i = 0; i < sums.Length; i++) //将排序后的数值按序输出
{
Console.Write(sums[i] + " ");
}
Console.ReadKey();
}
}
}