十行代码搞定 "冒泡排序"
来源:互联网 发布:qq显示mac在线怎么弄 编辑:程序博客网 时间:2024/05/16 08:54
Java Code:
class Class1
{
static void bubbleSort(int[] a)
{
for (int j = a.length - 1; j > 0; j--) // outer loop (backward)
for (int i = 0; i < j; i++) // inner loop (forward)
if (a[i] > a[i+1]) //Swap
{
a[i] = a[i] + a[i+1];
a[i+1] = a[i] - a[i+1];
a[i] = a[i] - a[i+1];
}
}
public static void main(String[] args)
{
int[] a = new int[]{-1,-2,9,4,5,3,7,1,2,3,1,2,3,-3,2,-19};
//int[] a = new int[]{9,8,7,6,5,4,3,2,1,0,11};
bubbleSort(a);
for (int i=0; i < a.length; i++)
{
System.out.println(a[i]);
}
}
}
C# Code:
class Class1
{
static void BubbleSort(int[] a)
{
for (int j = a.Length - 1; j > 0; j--) // outer loop (backward)
for (int i = 0; i < j; i++) // inner loop (forward)
if (a[i] > a[i+1])
{
//a[i] = a[i] + a[i+1];
//a[i+1] = a[i] - a[i+1];
//a[i] = a[i] - a[i+1];
Swap(ref a[i],ref a[i+1]);
}
}
static void Swap(ref int x,ref int y)
{
x = x + y;
y = x - y;
x = x - y;
}
static void Main(string[] args)
{
int[] a = new int[]{-1,-2,9,4,5,3,7,1,2,3,1,2,3,-3,2,-19};
//int[] a = new int[]{9,8,7,6,5,4,3,2,1,0,11};
BubbleSort(a);
for (int i=0; i < a.Length; i++)
{
System.Console.WriteLine(a[i]);
}
System.Console.ReadLine();
}
}
class Class1
{
static void bubbleSort(int[] a)
{
for (int j = a.length - 1; j > 0; j--) // outer loop (backward)
for (int i = 0; i < j; i++) // inner loop (forward)
if (a[i] > a[i+1]) //Swap
{
a[i] = a[i] + a[i+1];
a[i+1] = a[i] - a[i+1];
a[i] = a[i] - a[i+1];
}
}
public static void main(String[] args)
{
int[] a = new int[]{-1,-2,9,4,5,3,7,1,2,3,1,2,3,-3,2,-19};
//int[] a = new int[]{9,8,7,6,5,4,3,2,1,0,11};
bubbleSort(a);
for (int i=0; i < a.length; i++)
{
System.out.println(a[i]);
}
}
}
C# Code:
class Class1
{
static void BubbleSort(int[] a)
{
for (int j = a.Length - 1; j > 0; j--) // outer loop (backward)
for (int i = 0; i < j; i++) // inner loop (forward)
if (a[i] > a[i+1])
{
//a[i] = a[i] + a[i+1];
//a[i+1] = a[i] - a[i+1];
//a[i] = a[i] - a[i+1];
Swap(ref a[i],ref a[i+1]);
}
}
static void Swap(ref int x,ref int y)
{
x = x + y;
y = x - y;
x = x - y;
}
static void Main(string[] args)
{
int[] a = new int[]{-1,-2,9,4,5,3,7,1,2,3,1,2,3,-3,2,-19};
//int[] a = new int[]{9,8,7,6,5,4,3,2,1,0,11};
BubbleSort(a);
for (int i=0; i < a.Length; i++)
{
System.Console.WriteLine(a[i]);
}
System.Console.ReadLine();
}
}
- 十行代码搞定 "冒泡排序"
- 十行代码搞定无限极分类
- 【汇编】十以内冒泡排序
- 冒泡排序代码
- C#冒泡排序代码
- 冒泡排序代码
- 冒泡排序代码
- 冒泡排序代码实现
- java冒泡排序代码
- 冒泡排序代码
- 冒泡排序代码详解
- 冒泡排序代码
- 冒泡排序简易代码
- java冒泡排序代码
- 冒泡排序代码
- 数组冒泡排序代码
- 冒泡排序算法代码
- 冒泡排序代码
- AO 入门
- 用Delphi进行ArcObjects的应用开发
- MapControl&&PageLayoutControl
- 开场白
- 一个C串口通信程序
- 十行代码搞定 "冒泡排序"
- java日志03
- My First Blog
- C++类写的矩阵计算
- 我找了篇sea_bug的想法.:)
- 学概率,学市场营销!
- 科技节今晚开幕
- SQL语法
- 找实习单位未遂!