冒泡排序

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;


public class BubbleSort {
public static void main(String[] args) throws IOException {
BufferedReader in=new BufferedReader(new InputStreamReader(System.in));
String []s=in.readLine().trim().split(" ");
int a[]=new int[s.length];
for (int i = 0; i < s.length; i++) {
a[i]=Integer.parseInt(s[i]);
}
a=sortPrint(a);
for (int i :a) {
System.out.print(i+" ");
}
System.out.println();
}


private static int[] sortPrint(int[] a) {
// TODO Auto-generated method stub
for (int i = 0; i < a.length; i++) {
for (int j = 0; j < a.length-1-i; j++) {
if (a[j]>a[j+1]) {
a[j]=a[j]^a[j+1];
a[j+1]=a[j]^a[j+1];
a[j]=a[j]^a[j+1];
}
}
}
return a;
}

}

时间复杂度O（n*n）  

空间复杂度O（1）