排序面试2

来源：互联网发布：福建晨曦软件多少钱编辑：程序博客网时间：2024/05/21 15:01

1.利用一维数组实现冒泡排序

package net.dsyo.J2EEDemo4.Array;

public class BubbleSort {
static String sortArray(int before[]){
  String result = " ";
  for (int i=0;i<before.length;i++){
   result += before[i]+" ";
  }
  return result;
}

static int[] bubbleSort(int before[]){
  int t;
  for(int i=0;i<before.length;i++){
   for (int j=0;j<before.length-i-1;j++){
    if(before[j]>before[j+1]){
     t=before[j];
     before[j]=before[j+1];
     before[j+1]=t;
    }
   }
  }
  return before;
}

public static void main(String args[]){
  int a[]={12,43,23,56,3,53,231,34};
  System.out.println("Before sorting:"+sortArray(a));
  a=bubbleSort(a);
  System.out.println("After sorting:"+sortArray(a));
}
}

2.用Arrays 对象的 sort() 方法对数组排序

package net.dsyo.J2EEDemo4.Array;

import java.util.Arrays;
public class ArraysSort {
public static void main(String args[]){
  int[] a={12,4,7,2,8,13,9};
  System.out.println("Before Sorting:");
  for(int i = 0;i<a.length;i++){
   System.out.println("a["+i+"]="+a[i]+" ");
  }
  System.out.println("   ");
  Arrays.sort(a);
  System.out.println("After Sorting:");
  for(int i=0;i<a.length; i++){
   System.out.println("a["+i+"]="+a[i]+" ");
  }
}
}