数组排序

public class Test1 {//冒泡排序public static void main(String[] args) {int arr[]={12,8,42,35,1,9,10,55,19};int len = arr.length;for(int i=0; i<len-1; i++){for(int j=0; j<len-1; j++){if(arr[j]>arr[j+1]){int t=arr[j+1];arr[j+1]=arr[j];arr[j]=t;}}}for(int out=0; out<len; out++){System.out.print(arr[out]+"\t");}}}

<pre name="code" class="java"><pre name="code" class="java">public class Test2 {//选择排序public static void main(String[] args) {int arr[]={12,8,42,35,1,9,10,55,19};int len=arr.length;for(int i=0; i<len-1; i++){int min=i;for(int j=i+1; j<len; j++){if(arr[min]>arr[j]){min=j;}}int t=arr[min];arr[min]=arr[i];arr[i]=t;}for(int out=0; out<len; out++){System.out.print(arr[out]+"\t");}}}