冒泡排序:
package com.sort;
/**
* Java算法:冒泡排序
*/
public class Demo {
public static void main(String[] args) {
int[] result = sortOne(new int[]{49,22,45,1,34,22,56,9});
for(int i :result){
System.out.print(i+" ");
}
result = sortTwo(new int[]{49,22,45,1,34,22,56,9});
for(int i :result){
System.out.print(i+" ");
}
}
private static int[] sortOne(int[] resource){
int length = resource.length;
if(length == 0 || length ==1){
return resource;
}
for(int i = 0;i < length;i++){
for(int j = 0;j< length -i-1;j++){
if(resource[j] > resource[j+1]){
resource[j] = resource[j] + resource[j+1];
resource[j+1] = resource[j] -resource[j+1];
resource[j] = resource[j] -resource[j+1];
}
}
}
return resource;
}
private static int[] sortTwo(int[] resource){
int length = resource.length;
if(length == 0 || length ==1){
return resource;
}
for (int i = 0; i <= length - 1; i++)
{
for (int j = length - 1; j > i; j--)
{
if (resource[j] < resource[j - 1])
{
int temp = resource[j];
resource[j] = resource[j - 1];
resource[j - 1] = temp;
}
}
}
return resource;
}
}