using System;
namespace huangyibiao
{
class Program
{
//交换
public static void Swap(ref int iLeftParam, ref int iRightParam)
{
int iTemp = iLeftParam;
iLeftParam = iRightParam;
iRightParam = iTemp;
}
//冒泡排序,时间复杂度:O(n^2)
public static void BubbleSort(int[] iArrNumber)
{
for (int i = 0; i < iArrNumber.Length-1; i++)
{
for (int j = 0; j < iArrNumber.Length - i - 1; j++)
{
if (iArrNumber[j] > iArrNumber[j + 1])
Swap(ref iArrNumber[j], ref iArrNumber[j + 1]);
}
}
}
static void Main(string[] args)
{
int[] iArrNums = new int[] { 5, 2, 6, 1, 4, 2, 7, 8 };
BubbleSort(iArrNums);
foreach (var iValue in iArrNums)
{
Console.Write(iValue + " ");
}
Console.WriteLine();
Console.ReadLine();
}
}
}
C#冒泡排序
最新推荐文章于 2022-09-20 15:32:06 发布