publicclassbubbleSort{
publicstaticvoidBubbleSort(int[] a,int n){
int i, k = n;boolean flag;
flag =true;while(flag){
flag =false;for(i =1; i < k; i++){
if(a[i]< a[i -1]){
int temp;
temp = a[i];
a[i]= a[i -1];
a[i -1]=temp;
flag =true;}}
k--;}}}
2.2、冒泡排序测试用例
publicstaticvoidmain(String[] args){
int[] arr ={
1,5,6,9,4,8,2,3};BubbleSort(arr, arr.length);/*for (int i = 0; i < a.length; i++) {
System.out.print(a[i]+",");
}*/for(int i : arr){
System.out.print(i +",");}}
3、选择排序
publicclassselectSort{
publicstaticvoidSelectSort(int[] arr){
for(int i =0; i < arr.length -1; i++){
int minIndex = i;for(int j = i +1; j < arr.length; j++){
if(arr[j]<arr[minIndex])
minIndex=j;}if(i!=minIndex){
int temp;
temp=arr[i];
arr[i]=arr[minIndex];
arr[minIndex]=temp;}}}}
3.1、选择排序测试用例
publicstaticvoidmain(String[] args){
int[] arr={
1,5,6,8,7,4,3,9};SelectSort(arr);for(int i : arr){
System.out.print(i+",");}}
4、直接插入排序
publicclassInsertSort{
publicstaticvoidmain(String[] args){
int[] arr={
1,465,64,45,8,78,25,3,5};insertSort(arr);for(int i : arr){
System.out.print(i+",");}}publicstaticvoidinsertSort(int[] arr){
for(int i=1;i<arr.length;i++){
int temp=arr[i];int j=i-1;for(;j>0;j--){
if(arr[j]>temp){
arr[j+1]=arr[j];}else{
break;}}
arr[j+1]=temp;}}}