C#编程实现一个冒泡排序算法

Question

如题

Answer 1

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

namespace test11
{
class Program
{
const int N = 10;

static void Main(string[] args)
{
int[] a=new int[N];

for (int i = 0; i < N; i++)
a[i] =Convert.ToInt32( Console.ReadLine());

for(int i=0;i<N-1;i++)
for (int j = N - 2; j >= i; j--)
{
if (a[j+1] < a[j])
{
int t;
t = a[j+1];
a[j+1] = a[j];
a[j] = t;

}

}
for (int i = 0; i < N; i++)
Console.WriteLine("{0}", a[i]);

}
}
}

Answer 2

int[] l = { 5,3,7,1,0,9};//测试的数组
for (int i = 0; i <l.Length - 1; i++)
{
for (int j = 0; j < l.Length - i -1; j++)
{
//升续
if (l[j] > l[j + 1])
{
int temp = l[j];
l[j] = l[j + 1];
l[j + 1] = temp;
}

//降续
/*
if (l[j] < l[j + 1])
{
int temp = l[j];
l[j] = l[j + 1];
l[j + 1] = temp;
}
*/
}
}

Answer 3

public int[] maoPao(int[] list)//冒泡排序
{
int i, j, temp;

bool done = false;

j = 1;

while ((j < list.Length) && (!done))
{
done = true;

for (i = 0; i < list.Length - j; i++)
{

if (list[i] > list[i + 1])
{

done = false;

temp = list[i];

list[i] = list[i + 1];

list[i + 1] = temp;

}
}
j++;
}
return list;
}

Answer 4

public int[] Sort1(int[] item)
{
int i, j;
int temp;
for (i = 0; i < item.length; i++) {
for (j = 0; j < item.length - i - 1; j++) {
if (item[j] > item[j + 1]) {
temp = item[j];
item[j] = item[j + 1];
item[j + 1] = temp;
}
}
}
return item;
}

在网吧写的 没有调试 你试试

Answer 5

int[] a=new int{5,9,7,3,8};
int tmp=0;
for(int i=0;i<a.length-1;i++)
{
for(int j=i+1;j<a.length;j++)
{
if(a[i]<a[j])
{
tmp=a[i];
a[i]=a[j];
a[j]=tmp;
}
}
}