arithmetic 冒泡算法
1.使用冒泡算法进行排序,此冒泡算法是从最上面往下沉。属于反冒。
2.代码如下:
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
1 class Program
2 {
3 static void Main(string[] args)
4 {
5 int n = 10;
6 int temp;
7 int[] a = { 6,5,4,9,2,0,15,19,25,95};
8 for (int i = n-1; i>0; i--)
9 {
10 for (int j = 0; j < i; j++)
11 {
12 if (a[j] > a[j + 1])
13 {
14 temp = a[j];
15 a[j] = a[j+1];
16 a[j+1] = temp;
17 }
18 }
19 }
20
21 for (int i = 0; i < a.Length; i++)
22 {
23 Console.WriteLine(a[i]);
24 }
25 Console.ReadLine();
26 }
27
28
29 }
2 {
3 static void Main(string[] args)
4 {
5 int n = 10;
6 int temp;
7 int[] a = { 6,5,4,9,2,0,15,19,25,95};
8 for (int i = n-1; i>0; i--)
9 {
10 for (int j = 0; j < i; j++)
11 {
12 if (a[j] > a[j + 1])
13 {
14 temp = a[j];
15 a[j] = a[j+1];
16 a[j+1] = temp;
17 }
18 }
19 }
20
21 for (int i = 0; i < a.Length; i++)
22 {
23 Console.WriteLine(a[i]);
24 }
25 Console.ReadLine();
26 }
27
28
29 }
真正的冒泡算法:从底一直往上冒,小数直接从最低端开始冒泡。
代码如下:
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
static void Main(string[] args)
{
int temp;
int n = 9;
int[] a = { 5,3,6,1,8,10,15,2,4,66};
for (int i = 0; i < n - 1; i++)
{
for (int j = n - 1; j > i; j--)
{
if (a[j] < a[j - 1])
{
temp = a[j];
a[j] = a[j - 1];
a[j - 1] = temp;
}
}
}
foreach (var item in a)
{
Console.WriteLine(item);
}
Console.ReadLine();
}
{
int temp;
int n = 9;
int[] a = { 5,3,6,1,8,10,15,2,4,66};
for (int i = 0; i < n - 1; i++)
{
for (int j = n - 1; j > i; j--)
{
if (a[j] < a[j - 1])
{
temp = a[j];
a[j] = a[j - 1];
a[j - 1] = temp;
}
}
}
foreach (var item in a)
{
Console.WriteLine(item);
}
Console.ReadLine();
}