/**
* asc 升序
* desc 降序
*/
public class BubbleSort {
public static void main(String[] args) {
int[] a = new int[]{3, 5, 1, 43, 44, 2, 21, 44, 55, 77, 88, 33};
BubbleSort(a,"asc");
for (int i =0 ;i<a.length;i++)
System.out.print(a[i] + " ");
}
public static int[] BubbleSort(int[] a,String c){
int b;
if("asc".equals(c))
{ for (int i = 0 ;i < a.length;i++)
for (int l = 0;l < a.length;l++)
if(a[i] < a[l])
{
b = a[i];
a[i] = a[l];
a[l] = b;
} }
else if("desc".equals(c)){
for (int i = 0 ;i < a.length;i++)
for (int l = 0;l < a.length;l++)
if(a[i] > a[l])
{
b = a[i];
a[i] = a[l];
a[l] = b;
}
}
return a;
}
}
对无序数组进行排序
最新推荐文章于 2025-02-14 22:45:04 发布