質問編集履歴

初めての投稿で。コードの貼り方がわからなかったので、なおしました。

2019/12/05 05:56

投稿

NA051484

スコア5

test CHANGED Viewed

File without changes

test CHANGED Viewed

@@ -1,4 +1,428 @@
+```ここに言語を入力
+/**
+ * Searching Project
+ * See the Assignment 12 document (CSCI112_A12.pdf) for details.
+ *
+ * Author: N
+ */
+#include <iostream>
+#include <ctime>
+#include <cmath>
+#include <chrono>
+using namespace std;
+//Prototypes
+void duplicate(int[], int[], int);
+void printArray(int[], int);
+int linearSearch(int[], int, int);
+int iterativeBinarySearch(int[], int, int);
+int recursiveBinarySearch(int[], int, int,int);
+int jumpSearch(int[], int, int);
+void insertionSort(int[], int);
+/**
+ * Main Function.
+ */
+int main() {
+    //int LENGTH = 200000;
+    //int LENGTH = 150000;
+    //int LENGTH = 100000;
+	//int LENGTH = 75000;
+    int LENGTH = 50000;
+    int numbers[LENGTH];																//a single array
+    srand((int)time(0));																//random numbers in the range of 1 through LENGTH*2
+    for(int i = 0; i < LENGTH; i++) {
+	    numbers[i] = rand() % (LENGTH*2) + 1;
+	}
+    int value = numbers[rand() % LENGTH + 1];											//randomly choose a number to search
+	cout << "value: " << value;
+	cout << endl;
+    auto start = chrono::system_clock::now();											//Gets the start time
+	linearSearch(numbers,LENGTH, value);
+	/**
+ 	* Linear Search Algorithm Calculates the total duration
+ 	*/
+	chrono::duration<double> totalTime = chrono::system_clock::now() - start;			//Calculates the total duration (now - start)
+	cout << "Clock stopped." << endl;
+	cout << "Finished in linearSearchNumber " << totalTime.count() << " seconds" << endl;
+    cout << endl;
+	cout << "Sorting..." << endl;
+    insertionSort(numbers, LENGTH);
+	cout << "Done." << endl;
+	LENGTH = sizeof(numbers)/4;      													//Calculates the length of the array
+	start = chrono::system_clock::now();
+    iterativeBinarySearch(numbers, LENGTH, value);
+	/**
+ 	* Iterative Binary Search Calculates the total duration
+ 	*/
+	totalTime = chrono::system_clock::now() - start;									//Calculates the total duration (now - start)
+	cout << "Clock stopped." << endl;
+	cout << "Finished in iterativeBinarySearch " << totalTime.count() << " seconds" << endl;
+	start = chrono::system_clock::now();
+	recursiveBinarySearch(numbers, 0, LENGTH - 1, value);
+	/**
+ 	* Recursive Binary Search Calculates the total duration
+ 	*/
+	cout << "Clock stopped." << endl;
+	cout << "Finished in recursiveBinarySearch " << totalTime.count() << " seconds" << endl;
+	start = chrono::system_clock::now();
+	                                                    								 //Calculates the length of the array
+	jumpSearch(numbers, LENGTH, value);
+	/**
+ 	* Jump Search Calculates the total duration
+ 	*/
+	cout << "Clock stopped." << endl;
+	cout << "Finished in jumpSearch " << totalTime.count() << " seconds" << endl;
+    return 0;
+}
+void insertionSort(int a[], int length) {
+    for(int i = 1; i < length; i++) {
+		int value = a[i];
+		int j = i-1;
+		while(j >= 0 && a[j] > value) {
+			a[j+1] = a[j];
+			j--;
+		}
+		a[j+1] = value;
+	}
+}
+/**
+ * Linear Search Algorithm
+ */
+int linearSearch(int a[], int length, int searchValue) {
+    for(int i = 0; i < length; i++) {
+	    if(a[i] == searchValue) {
+            return i;                                                                       //The index we found it at
+        }
+	}
+    return -1;
+}
+/**
+ * Binary Search Algorithm
+ */
+int iterativeBinarySearch(int a[], int length, int searchValue) {
+    int lowBoundary = 0;
+	int highBoundary = length - 1;
+	while(highBoundary >= lowBoundary) {
+		int middle = (highBoundary + lowBoundary) / 2;                                     //Calculate middle index
+		if(searchValue == a[middle]) {
+			return middle;                                                                 //Return the index we found it at
+		}
+		else if(searchValue > a[middle]) {
+			lowBoundary = middle + 1;                                                      //Raise the low boundary
+		}
+		else {
+			highBoundary = middle - 1;                                                     //Lower the high boundary
+		}
+	}
+	return -1;
+}
+/**
+ * Recursive Binary Search Algorithm
+ */
+int recursiveBinarySearch(int array[], int first, int last, int value) {
+   if(first > last) {
+      return -1;                                                                        //First base Case
+   }
+   int middle = (first + last) / 2;                                                     //Calculate the middle position.
+   if(array[middle] == value) {
+      return middle;                                                                    //Second base case
+   }
+   else if (array[middle] < value) {
+      return recursiveBinarySearch(array, middle + 1, last, value);                     //Recursive case (Search upper partition/upper half)
+   }
+   else {
+      return recursiveBinarySearch(array, first, middle - 1, value);                    //Recursive case (Search lower partition/lower half)
+   }
+}
+/**
+ * Jump Search Algorithm
+ */
+int jumpSearch(int a[], int length, int searchValue) {
+    int previous = 0;
+	int jump = (int) sqrt(length);
+	while(a[(jump < length ? jump : length-1)-1] < searchValue) {
+		previous = jump;
+		jump += jump;
+		if(jump >= length) {
+            break;
+		}
+	}
+	while(a[previous] < searchValue) {
+		previous += 1;
+		if(previous == (jump < length ? jump : length)) {
+			return -1;
+		}
+	}
+	return a[previous] == searchValue ? previous : -1;
+}
+/**
+ * Simply prints the current values in the array.
+ */
+void printArray(int a[], int length) {
+    cout << "Current values in the array: " << endl;
+    for(int i = 0; i < length; i++) {
+	    cout << a[i] << " ";
+	}
+    cout << endl;
+}
+```ここに言語を入力
+コード
+```
-### 前提・実現したいこと
+```### 前提・実現したいこと
 今学校の課題でC++を習ってます、Linear Search、(Iterative) Binary Search、(Recursive) Binary Search、
@@ -60,423 +484,11 @@
 ### 該当のソースコード
-/**
- * Searching Project
- * See the Assignment 12 document (CSCI112_A12.pdf) for details.
- *
- * Author: N
+```ここに言語を入力
- */
-#include <iostream>
-#include <ctime>
-#include <cmath>
-#include <chrono>
-using namespace std;
-//Prototypes
-void duplicate(int[], int[], int);
-void printArray(int[], int);
-int linearSearch(int[], int, int);
-int iterativeBinarySearch(int[], int, int);
-int recursiveBinarySearch(int[], int, int,int);
-int jumpSearch(int[], int, int);
-void insertionSort(int[], int);
-/**
- * Main Function.
- */
-int main() {
-    //int LENGTH = 200000;
-    //int LENGTH = 150000;
-    //int LENGTH = 100000;
-	//int LENGTH = 75000;
-    int LENGTH = 50000;
-    int numbers[LENGTH];																//a single array
-    srand((int)time(0));																//random numbers in the range of 1 through LENGTH*2
-    for(int i = 0; i < LENGTH; i++) {
-	    numbers[i] = rand() % (LENGTH*2) + 1;
-	}
-    int value = numbers[rand() % LENGTH + 1];											//randomly choose a number to search
-	cout << "value: " << value;
-	cout << endl;
-    auto start = chrono::system_clock::now();											//Gets the start time
-	linearSearch(numbers,LENGTH, value);
-	/**
- 	* Linear Search Algorithm Calculates the total duration
- 	*/
-	chrono::duration<double> totalTime = chrono::system_clock::now() - start;			//Calculates the total duration (now - start)
-	cout << "Clock stopped." << endl;
-	cout << "Finished in linearSearchNumber " << totalTime.count() << " seconds" << endl;
-    cout << endl;
-	cout << "Sorting..." << endl;
-    insertionSort(numbers, LENGTH);
-	cout << "Done." << endl;
-	LENGTH = sizeof(numbers)/4;      													//Calculates the length of the array
-	start = chrono::system_clock::now();
-    iterativeBinarySearch(numbers, LENGTH, value);
-	/**
- 	* Iterative Binary Search Calculates the total duration
- 	*/
-	totalTime = chrono::system_clock::now() - start;									//Calculates the total duration (now - start)
-	cout << "Clock stopped." << endl;
-	cout << "Finished in iterativeBinarySearch " << totalTime.count() << " seconds" << endl;
-	start = chrono::system_clock::now();
-	recursiveBinarySearch(numbers, 0, LENGTH - 1, value);
-	/**
- 	* Recursive Binary Search Calculates the total duration
- 	*/
-	cout << "Clock stopped." << endl;
-	cout << "Finished in recursiveBinarySearch " << totalTime.count() << " seconds" << endl;
-	start = chrono::system_clock::now();
-	                                                    								 //Calculates the length of the array
-	jumpSearch(numbers, LENGTH, value);
-	/**
- 	* Jump Search Calculates the total duration
- 	*/
-	cout << "Clock stopped." << endl;
-	cout << "Finished in jumpSearch " << totalTime.count() << " seconds" << endl;
-    return 0;
-}
-void insertionSort(int a[], int length) {
-    for(int i = 1; i < length; i++) {
-		int value = a[i];
-		int j = i-1;
-		while(j >= 0 && a[j] > value) {
-			a[j+1] = a[j];
-			j--;
+コード
-		}
-		a[j+1] = value;
-	}
-}
-/**
- * Linear Search Algorithm
- */
-int linearSearch(int a[], int length, int searchValue) {
-    for(int i = 0; i < length; i++) {
-	    if(a[i] == searchValue) {
-            return i;                                                                       //The index we found it at
-        }
-	}
-    return -1;
-}
-/**
- * Binary Search Algorithm
- */
-int iterativeBinarySearch(int a[], int length, int searchValue) {
-    int lowBoundary = 0;
-	int highBoundary = length - 1;
-	while(highBoundary >= lowBoundary) {
-		int middle = (highBoundary + lowBoundary) / 2;                                     //Calculate middle index
-		if(searchValue == a[middle]) {
-			return middle;                                                                 //Return the index we found it at
-		}
-		else if(searchValue > a[middle]) {
-			lowBoundary = middle + 1;                                                      //Raise the low boundary
-		}
-		else {
+```
-			highBoundary = middle - 1;                                                     //Lower the high boundary
-		}
-	}
-	return -1;
-}
-/**
- * Recursive Binary Search Algorithm
- */
-int recursiveBinarySearch(int array[], int first, int last, int value) {
-   if(first > last) {
-      return -1;                                                                        //First base Case
-   }
-   int middle = (first + last) / 2;                                                     //Calculate the middle position.
-   if(array[middle] == value) {
-      return middle;                                                                    //Second base case
-   }
-   else if (array[middle] < value) {
-      return recursiveBinarySearch(array, middle + 1, last, value);                     //Recursive case (Search upper partition/upper half)
-   }
-   else {
-      return recursiveBinarySearch(array, first, middle - 1, value);                    //Recursive case (Search lower partition/lower half)
-   }
-}
-/**
- * Jump Search Algorithm
- */
-int jumpSearch(int a[], int length, int searchValue) {
-    int previous = 0;
-	int jump = (int) sqrt(length);
-	while(a[(jump < length ? jump : length-1)-1] < searchValue) {
-		previous = jump;
-		jump += jump;
-		if(jump >= length) {
-            break;
-		}
-	}
-	while(a[previous] < searchValue) {
-		previous += 1;
-		if(previous == (jump < length ? jump : length)) {
-			return -1;
-		}
-	}
-	return a[previous] == searchValue ? previous : -1;
-}
-/**
- * Simply prints the current values in the array.
- */
-void printArray(int a[], int length) {
-    cout << "Current values in the array: " << endl;
-    for(int i = 0; i < length; i++) {
-	    cout << a[i] << " ";
-	}
-    cout << endl;
-}
 ### 試したこと