C# 冒泡的算法
public void BubbleSort(int[] arr)
{int temp;for (int j = 0; j <= arr.Length - 2; j++){for (int i = 0; i <= arr.Length - 2; i++){if (arr[i] > arr[i + 1]){temp = arr[i + 1];arr[i + 1] = arr[i];arr[i] = temp;}}}
}
使用方法
int[] array = new int[] { 5, 3, 8, 1, 2, 9, 4, 7, 6 };
BubbleSort(array);foreach (var item in array)
{Console.WriteLine(item);
}
```csharp
