冒泡排序的两种方法
代码:
class Program
{
static void Main(string[] args)
{
int[] a = new int[] {12,65,32,45,10 };
//ListAction(a);//do while实现
ListAction1(a);//两层for循环实现
foreach (var i in a)
{
Console.WriteLine(i);
}
Console.ReadKey();
}
static void ListAction(int[] arg) {
bool isTrans = true;
do
{
isTrans = false;
for (int i = 0; i < arg.Length-1; i++)
{
if (arg[i] > arg[i + 1])
{
int temp = arg[i];
arg[i] = arg[i + 1];
arg[i + 1] = temp;
isTrans = true;
}
}
} while (isTrans==true);
}
static void ListAction1(int[] arg)
{
for (int i = 0; i < arg.Length-1; i++)
{
for (int j = 0; j < arg.Length-1-i; j++)
{
if (arg[j] > arg[j + 1])
{
int temp = arg[j];
arg[j] = arg[j + 1];
arg[j + 1] = temp;
}
}
}
}
}