冒泡排序JavaScript---------
//冒泡排序
C#-------------------------
//冒泡排序
function b(arr)
{
var i = arr.length, j;
var temp;
while (i > 0)
{
for (var j = 0; j < i + 1; j++)
{
if (arr[j] > arr[j + 1])
{
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
i--;
}
return arr;
}
C#-------------------------
static void Main()
{
int temp = 0;
int[] arr = { 23, 44, 66, 77, 98, 11 };
Console.WriteLine("排序前数组");
foreach (int item in arr)
{
Console.Write(item + "");
}
Console.WriteLine();
for (int i = 0; i < arr.Length-1; i++)
{