冒泡排序:
class Untitled {
public static void bubbleSort(int a[]){
for(int i=0;i<a.length;i++){
for(int j=0;j<a.length-i-1;j++){
if(a[j]>a[j+1]){
int temp=a[j];
a[j]=a[j+1];
a[j+1]=temp;
}
}
}
}
public static void main(String[] args) {
int a[]={3,4,2,1,5};
bubbleSort(a);
for(int i=0;i<a.length;i++)
System.out.println(a[i]);
}
}
快速排序:
class Untitled {
public static int[] quickSort(int a[],int start,int end){
if(start<end) {
int i = start;
int j = end;
int temp = a[start];
while (i < j) {
while (i < j && temp <= a[j])
j--;
a[i] = a[j];
while (i < j && temp >= a[i])
i++;
a[j] = a[i];
}
a[i] = temp;
quickSort(a, start, i - 1);
quickSort(a, i + 1, end);
}
return a;
}
public static void main(String[] args) {
int a[]={3,4,2,1,5};
int b[]=quickSort(a,0,a.length-1);
for(int i=0;i<b.length;i++)
System.out.println(b[i]);
}
}