// Use this for initialization void Start() { int n = 10000; int[] arr = AlgorithmsHelp.generateNearlyOrderArray(n, 0); int[] arrCopy = AlgorithmsHelp.CopyIntArray(arr, n); int needFindValue = 500; int index = HalfFind1(arr, n, needFindValue); int index2 = HalfFind2(arr, n, needFindValue); print(index == -1 ? "No Find Value" : "Find value in + arr " + index + " and arr[index] = " + arr[index]); print(index2 == -1 ? "No Find Value" : "Find value in + arr " + index2 + " and arrCopy[index2] = " + arrCopy[index2]); }
// Use this for initialization void Start() { // int n = 1000; // //实验1 // int[] arr = AlgorithmsHelp.generateRandomArray (n, 1, n); // int[] sameArr = AlgorithmsHelp.CopyIntArray (arr,n); // AlgorithmsHelp.testSort ("InsertionSort1", InsertionSort1, sameArr, n); // AlgorithmsHelp.printData (sameArr); //// AlgorithmsHelp.testSort ("SelectionSort", SelectSort.SelectionSort,arr,n); //// AlgorithmsHelp.printData (sameArr); // AlgorithmsHelp.testSort ("InsertionSort", InsertionSort, arr, n); // AlgorithmsHelp.printData (arr); //实验2 比较有序数组的,选择排序的超快性 int n = 10000; int[] arr = AlgorithmsHelp.generateNearlyOrderArray(n, 10); int[] sameArr = AlgorithmsHelp.CopyIntArray(arr, n); AlgorithmsHelp.testSort("InsertionSort1", InsertionSort1, arr, n); AlgorithmsHelp.printData(arr); AlgorithmsHelp.testSort("SelectionSort", SelectSort.SelectionSort, sameArr, n); AlgorithmsHelp.printData(sameArr); }