冒泡排序
public class BubbleSort {
public static void main(String[] args){
int[] nums = {6,2,13,7,4};
int[] numx = bubblest(nums);
System.out.println(Arrays.toString(numx));
}
public static int[] bubblest(int[] Arrays){
int cen = 0;
for(int i=0;i< Arrays.length-1;i++){
boolean judge = false;
for(int j=0;j< Arrays.length-i-1;j++){
if(Arrays[j]>Arrays[j+1]){
cen = Arrays[j];
Arrays[j] = Arrays[j+1];
Arrays[j+1] = cen;
judge = true;
}
}
if(judge = false){
break;
}
}
return Arrays;
}
}
选择排序
import java.util.Arrays;
public class SelectSort{
public static void main(String[] args){
int[] nums = {1,2,3,4,5};
int[] numx = selectsort(nums);
System.out.print(Arrays.toString(numx));
}
public static int[] selectsort(int[] arrs){
int str;
int minindex;
for(int i=0;i<arrs.length-1;i++){
minindex = i;
for(int j=i+1;j<arrs.length;j++){
if(arrs[minindex]<arrs[j]){
minindex = j;
}
}
str = arrs[minindex];
arrs[minindex] = arrs[i];
arrs[i] = str;
}
return arrs;
}
}
插入排序
import java.util.Arrays;
public class InsertionSort{
public static void main(String[] args){
int[] nums = {1,2,3,4,5};
int[] numx = ins(nums);
System.out.print(Arrays.toString(numx));
}
static int[] ins(int[] arr){
int current;
int preIndex;
for(int i=1;i<arr.length;i++){
current = arr[i];
preIndex = i-1;
while(preIndex>=0 && current>arr[preIndex]){
arr[preIndex + 1] = arr[preIndex];
preIndex--;
}
arr[preIndex+1] = current;
}
return arr;
}
public static int[] insertionsort(int[] arrs){
int ct;
for(int i=1;i<arrs.length;i++){
for(int j=i;j>0;j--){
if(arrs[j]>arrs[j-1]){
ct = arrs[j];
arrs[j] = arrs[j-1];
arrs[j-1] = ct;
}else{
break;
}
}
}
return arrs;
}
}