版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/AngeloWolf/article/details/52234615
package com.angelo;
import java.util.Random;
import java.util.Scanner;
public class DirectorSort {
@SuppressWarnings("resource")
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("输入数组大小:");
int k = sc.nextInt();
int array[] = new int[k];
for (int i = 0; i < array.length; i++) {
Random rd = new Random();
int s = rd.nextInt(30);
array[i] = s;
}
System.out.println("数组排序之前:");
print(array);
System.out.println("数组排序之后:");
directorSort(array);
print(array);
}
public static void print(int[] a){
for(int i=0;i<a.length;i++){
System.out.print(a[i]+"\t");
}
System.out.println();
}
public static void directorSort(int [] b){
int temp;
int j;
for(int i=1;i<b.length;i++){
temp=b[i];
for(j=i-1;j>=0&&b[j]>temp;j--){
b[j+1]=b[j];
}
b[j+1]=temp;
System.out.println();
}
}
import java.util.Random;
import java.util.Scanner;
public class DirectorSort {
@SuppressWarnings("resource")
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
System.out.println("输入数组大小:");
int k = sc.nextInt();
int array[] = new int[k];
for (int i = 0; i < array.length; i++) {
Random rd = new Random();
int s = rd.nextInt(30);
array[i] = s;
}
System.out.println("数组排序之前:");
print(array);
System.out.println("数组排序之后:");
directorSort(array);
print(array);
}
public static void print(int[] a){
for(int i=0;i<a.length;i++){
System.out.print(a[i]+"\t");
}
System.out.println();
}
public static void directorSort(int [] b){
int temp;
int j;
for(int i=1;i<b.length;i++){
temp=b[i];
for(j=i-1;j>=0&&b[j]>temp;j--){
b[j+1]=b[j];
}
b[j+1]=temp;
System.out.println();
}
}
}
数据变化: