Merge Sort

Author: TORRYNN

.vscode/c_cpp_properties.json

@@ -0,0 +1,18 @@
+{
+ "configurations": [
+ {
+ "name": "windows-gcc-x86",
+ "includePath": [
+ "${workspaceFolder}/**"
+ ],
+ "compilerPath": "C:/MinGW/bin/gcc.exe",
+ "cStandard": "${default}",
+ "cppStandard": "${default}",
+ "intelliSenseMode": "windows-gcc-x86",
+ "compilerArgs": [
+ ""
+ ]
+ }
+ ],
+ "version": 4
+}

.vscode/launch.json

@@ -0,0 +1,24 @@
+{
+ "version": "0.2.0",
+ "configurations": [
+ {
+ "name": "C/C++ Runner: Debug Session",
+ "type": "cppdbg",
+ "request": "launch",
+ "args": [],
+ "stopAtEntry": false,
+ "externalConsole": true,
+ "cwd": "d:/CODING/Codding/ADA",
+ "program": "d:/CODING/Codding/ADA/build/Debug/outDebug",
+ "MIMode": "gdb",
+ "miDebuggerPath": "gdb",
+ "setupCommands": [
+ {
+ "description": "Enable pretty-printing for gdb",
+ "text": "-enable-pretty-printing",
+ "ignoreFailures": true
+ }
+ ]
+ }
+ ]
+}

.vscode/settings.json

@@ -1,3 +1,60 @@
 {
-"java.dependency.packagePresentation": "hierarchical"
-}
+ "java.dependency.packagePresentation": "hierarchical",
+ "C_Cpp_Runner.cCompilerPath": "gcc",
+ "C_Cpp_Runner.cppCompilerPath": "g++",
+ "C_Cpp_Runner.debuggerPath": "gdb",
+ "C_Cpp_Runner.cStandard": "",
+ "C_Cpp_Runner.cppStandard": "",
+ "C_Cpp_Runner.msvcBatchPath": "C:/Program Files/Microsoft Visual Studio/VR_NR/Community/VC/Auxiliary/Build/vcvarsall.bat",
+ "C_Cpp_Runner.useMsvc": false,
+ "C_Cpp_Runner.warnings": [
+ "-Wall",
+ "-Wextra",
+ "-Wpedantic",
+ "-Wshadow",
+ "-Wformat=2",
+ "-Wcast-align",
+ "-Wconversion",
+ "-Wsign-conversion",
+ "-Wnull-dereference"
+ ],
+ "C_Cpp_Runner.msvcWarnings": [
+ "/W4",
+ "/permissive-",
+ "/w14242",
+ "/w14287",
+ "/w14296",
+ "/w14311",
+ "/w14826",
+ "/w44062",
+ "/w44242",
+ "/w14905",
+ "/w14906",
+ "/w14263",
+ "/w44265",
+ "/w14928"
+ ],
+ "C_Cpp_Runner.enableWarnings": true,
+ "C_Cpp_Runner.warningsAsError": false,
+ "C_Cpp_Runner.compilerArgs": [],
+ "C_Cpp_Runner.linkerArgs": [],
+ "C_Cpp_Runner.includePaths": [],
+ "C_Cpp_Runner.includeSearch": [
+ "*",
+ "**/*"
+ ],
+ "C_Cpp_Runner.excludeSearch": [
+ "**/build",
+ "**/build/**",
+ "**/.*",
+ "**/.*/**",
+ "**/.vscode",
+ "**/.vscode/**"
+ ],
+ "C_Cpp_Runner.useAddressSanitizer": false,
+ "C_Cpp_Runner.useUndefinedSanitizer": false,
+ "C_Cpp_Runner.useLeakSanitizer": false,
+ "C_Cpp_Runner.showCompilationTime": false,
+ "C_Cpp_Runner.useLinkTimeOptimization": false,
+ "C_Cpp_Runner.msvcSecureNoWarnings": false
+}

25_Divide and Conquer/MergeSort.class

@@ -0,0 +1,71 @@
+public class MergeSort {
+ public static void mergeSort(int arr[], int lowerbound, int upperbound) {
+ // Base Condition
+ if (lowerbound >= upperbound)
+ return;
+ int mid = lowerbound + (upperbound - lowerbound) / 2;
+
+ mergeSort(arr, lowerbound, mid);
+ mergeSort(arr, mid + 1, upperbound);
+ merge(arr, lowerbound, mid, upperbound);
+ }
+
+ public static void merge(int arr[], int lowerbound, int mid, int upperbound) {
+ // Creating a temporary array
+ int temp[] = new int[upperbound - lowerbound + 1];
+ // Iterator for left part;
+ int i = lowerbound;
+ // Iterator for right part;
+ int j = mid + 1;
+ // Iterator for temp array;
+ int k = 0;
+
+ while (i <= mid && j <= upperbound) {
+ if (arr[i] <= arr[j]) {
+ temp[k] = arr[i];
+ i++;
+
+ } else {
+ temp[k] = arr[j];
+ j++;
+ }
+ k++;
+ }
+
+ 
+ // Copying the remaining element of the left half if any
+
+ while (i <= mid) {
+ temp[k++] = arr[i++];
+ }
+
+ // Copying the remaining element of the right half ,if any
+ while (j <= upperbound) {
+ temp[k++] = arr[j++];
+ }
+ // Copying temporary Array to Original Array
+ for (k = 0, i = lowerbound; k < temp.length; k++, i++) {
+ arr[i] = temp[k];
+
+ }
+
+ }
+ // Time Complexity: O(nlogn);
+ // Space Complexity: O(n)
+ public static void printArr(int arr[]) {
+ for (int num : arr) {
+ System.out.print(num+" ");
+ }
+ System.out.println();
+ }
+
+ public static void main(String[] args) {
+ int arr[] = { 6, 3, 9, 5, 2, 8 };
+ System.out.println("Array before sorting");
+ printArr(arr);
+ mergeSort(arr, 0, arr.length - 1);
+ System.out.println("Array after sorting");
+ printArr(arr);
+
+ }
+}