冒泡排序

一觉醒来，没事干，写个冒泡醒醒睡意！

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace ConsoleApplication1
{
class Program
{
static void Main(string[] args)
{
int[] arrs = { 1, 3, 5, 4, 2, 3, 5, 3, 5, 6, 8, 9, 2, 10 };
Srot(arrs);
foreach (int item in arrs)
{
Console.WriteLine(item);
}

Console.ReadKey();
}

public static Array Srot(int[] arr)
{
int temp;
for (int i = 0; i < arr.Length - 1; i++)
{
for (int j = 0; j < arr.Length - 1 - i; j++)
{
if (arr[j] > arr[j + 1])
{
temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}

return arr;

}
}
}