C# 实现冒泡算法

/// <summary>
/// 使用两次循环
/// </summary>
/// <param name="arr"></param>
static void Sort(int[] arr)
{
int temp;
for (int i = 0; i < arr.Length; i++)
{
for (int j = 0; j < arr.Length - i - 1; j++)
{
if (arr[j] > arr[j + 1])
{
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}

}

}
}

/// <summary>
/// 使用递归来实现冒泡
/// </summary>
/// <param name="arr"></param>
/// <param name="index">趟次</param>
static void SortRecursion(int[] arr, int index)
{
if (arr.Length - 1 == index)
{
return;
}
int temp;
for (int j = 0; j < arr.Length - index - 1; j++)
{
if (arr[j] > arr[j + 1])
{
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
SortRecursion(arr, ++index);
}

static void Main(string[] args)
{
int[] arr = { 8, 5, 47, 1, 23, 6, 9, 21 };

SortRecursion(arr, 0);

for (int i = 0; i < arr.Length; i++)
{//排序后打印数组中的元素
System.Console.WriteLine("Index: " + i + "  value: " + arr[i]);
}

System.Console.ReadKey();
}