java System.copyarray()

package com.gdcp; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.IOException; import java.util.Scanner; public class SortManager { private static final Scanner sc= new Scanner(System.in); //初始化的数组 private static int arrlength = 100; private static int[] initArray = new int[arrlength]; private static int[] resultArray; private static boolean isExitMain =false; private static boolean selectDataSource =true; private static boolean selectSort=true; //与性能相关的变量 private static int moveCount=0; private static int compareCount=0; private static long runTime; public static void main(String[] args) throws IOException { // System.out.println(); //快捷键sout int choice = 0; do { while (selectDataSource){ mainMenu(); choice = sc.nextInt(); switch (choice){ case 1: ascArray(); break; case 2: descArray(); break; case 3: randomArray(); break; case 4: scannerArray(); break; case 5: fileArray(); break; default: System.out.println("bye-bye! 欢迎再次使用排序器！"); break; } selectDataSource=false; } //排序方法的选择 while (selectSort){ sortMenu(); choice = sc.nextInt(); switch (choice){ case 1: System.out.println("排序前的数组："); printArray(initArray); copyArray(); System.out.println("排序后的数组："); straightInsertSort(); printArray(resultArray); System.out.println(); printXingneng(); break; case 2: System.out.println("排序前的数组："); printArray(initArray); copyArray(); System.out.println("排序后的数组："); package com.gdcp; import java.io.FileInputStream; import java.io.FileNotFoundException; import java.io.IOException; import java.util.Scanner; public class SortManager { private static final Scanner sc= new Scanner(System.in); //初始化的数组 private static int arrlength = 100; private static int[] initArray = new int[arrlength]; private static int[] resultArray; private static boolean isExitMain =false; private static boolean selectDataSource =true; private static boolean selectSort=true; //与性能相关的变量 private static int moveCount=0; private static int compareCount=0; private static long runTime; public static void main(String[] args) throws IOException { // System.out.println(); //快捷键sout int choice = 0; do { while (selectDataSource){ mainMenu(); choice = sc.nextInt(); switch (choice){ case 1: ascArray(); break; case 2: descArray(); break; case 3: randomArray(); break; case 4: scannerArray(); break; case 5: fileArray(); break; default: System.out.println("bye-bye! 欢迎再次使用排序器！"); break; } selectDataSource=false; } //排序方法的选择 while (selectSort){ sortMenu(); choice = sc.nextInt(); switch (choice){ case 1: System.out.println("排序前的数组："); printArray(initArray); copyArray(); System.out.println("排序后的数组："); straightInsertSort(); printArray(resultArray); System.out.println(); printXingneng(); break; case 2: System.out.println("排序前的数组："); printArray(initArray); copyArray(); System.out.println("排序后的数组："); shellSort(); printArray(resultArray); System.out.println(); printXingneng(); break; case 3: System.out.println("排序前的数组："); printArray(initArray); copyArray(); System.out.println("排序后的数组："); straightSelectionSort(); printArray(resultArray); System.out.println(); printXingneng(); break; case 4: System.out.println("排序前的数组："); printArray(initArray); copyArray(); System.out.println("排序后的数组："); bubblingSort(); printArray(resultArray); System.out.println(); printXingneng(); break; case 5: printArray(initArray); break; case 6: printArray(initArray); break; default: System.out.println("bye-bye! 欢迎再次使用排序器！"); break; } selectSort=false; } //是否继续？ continueMenu(); choice=sc.nextInt(); switch (choice){ case 1: isExitMain=true; break; case 2: selectDataSource=true; selectSort=true; break; case 3: selectDataSource=false; selectSort=true; break; } }while (!isExitMain); } private static void printXingneng(){ System.out.println("移动次数："+moveCount+"\t"); System.out.println("比较次数："+compareCount+"\t"); System.out.println("运行时间："+runTime); } private static void shellSort(){ long startTime = System.nanoTime(); moveCount =0; compareCount =0; runTime =0; //定义一些变量 int i,j,temp; //定义增量 int gap; for (gap=arrlength/2; gap>=1; gap/=2) { compareCount++; for (i=gap;i<arrlength;i++){ j=i-gap; temp=initArray[i]; compareCount++; moveCount++; while ((j>=0) && (resultArray[j]>temp)) { initArray[j+gap]=resultArray[j]; j-=gap; compareCount+=2; moveCount++; } resultArray[j+gap]=temp; moveCount++; } } runTime=System.nanoTime()-startTime; } //复制数组 private static void copyArray(){ resultArray=new int[arrlength]; for(int i=0;i<resultArray.length;i++){ resultArray[i]=initArray[i]; } } private static void straightInsertSort(){ long startTime = System.nanoTime(); moveCount = 0; compareCount = 0; runTime = 0; int i,j,temp; for(i=1;i<arrlength;i++){ temp = resultArray[i]; j=i-1; compareCount++; moveCount++; while(j>=0 && resultArra