implemented Min and Max (D&C) in C and C++, updated README.md

Author: xshthkr

README.md

@@ -1285,13 +1285,13 @@ In order to achieve greater coverage and encourage more people to contribute to
   <tr>
   <td>Min and Max (D&C)</td>
   <td> <!-- C -->
-  <a href="./CONTRIBUTING.md">
-  <img align="center" height="25" src="./logos/github.svg" />
+  <a href="./src/c/MinMaxDC.c">
+  <img align="center" height="25" src="./logos/c.svg" />
   </a>
   </td>
   <td> <!-- C++ -->
-  <a href="./CONTRIBUTING.md">
-  <img align="center" height="25" src="./logos/github.svg" />
+  <a href="./src/cpp/MinMaxDC.cpp">
+  <img align="center" height="25" src="./logos/cplusplus.svg" />
   </a>
   </td>
   <td> <!-- Java -->

src/c/MinMaxDC.c

@@ -0,0 +1,57 @@
+#include <stdio.h>
+
+/**
+ * Function to find both the minimum and maximum elements in an array
+ *
+ * @param arr The array to search in
+ * @param left The left index of the sub-array.
+ * @param right The right index of the sub-array
+ * @param min Pointer to store the minimum element
+ * @param max Pointer to store the maximum element
+ */
+
+void MinAndMax(int arr[], int left, int right, int* min, int* max) {
+ // if there is only one element in the sub-array, set it as both min and max
+ if (left == right) {
+ *min = *max = arr[left];
+ return;
+ }
+
+ // if there are two elements in the sub-array, compare and set min and max
+ if (right - left == 1) {
+ if (arr[left] < arr[right]) {
+ *min = arr[left];
+ *max = arr[right];
+ } else {
+ *min = arr[right];
+ *max = arr[left];
+ }
+ return;
+ }
+
+ // calculate the middle index of the sub-array
+ int mid = (left + right) / 2;
+ int leftMin, leftMax, rightMin, rightMax;
+
+ // recursively find min and max in the left and right sub-arrays
+ MinAndMax(arr, left, mid, &leftMin, &leftMax);
+ MinAndMax(arr, mid + 1, right, &rightMin, &rightMax);
+
+ // update the minimum and maximum values
+ *min = (leftMin < rightMin) ? leftMin : rightMin;
+ *max = (leftMax > rightMax) ? leftMax : rightMax;
+}
+
+int main() {
+ int arr[] = {10, 5, 20, 8, 15, 30, -12, 24};
+ int arrSize = sizeof(arr) / sizeof(arr[0]);
+
+ int min, max;
+
+ MinAndMax(arr, 0, arrSize - 1, &min, &max);
+
+ printf("Minimum element: %d\n", min);
+ printf("Maximum element: %d\n", max);
+
+ return 0;
+}

src/cpp/MinMaxDC.cpp

@@ -0,0 +1,59 @@
+#include <iostream>
+#include <vector>
+
+/**
+ * Function to find both the minimum and maximum elements in an array
+ *
+ * @param arr The array to search in
+ * @param left The left index of the sub-array
+ * @param right The right index of the sub-array
+ * @param min Reference to store the minimum element
+ * @param max Reference to store the maximum element
+ */
+
+void MinAndMax(const std::vector<int>& arr, int left, int right, int& min, int& max) {
+ 
+ // if there is only one element in the subarray, it is both the minimum and maximum
+ if (left == right) {
+ min = max = arr[left];
+ return;
+ }
+
+ // if there are two elements, compare and set min and max
+ if (right - left == 1) {
+ if (arr[left] < arr[right]) {
+ min = arr[left];
+ max = arr[right];
+ }
+ else {
+ min = arr[right];
+ max = arr[left];
+ }
+ return;
+ }
+
+ // calculate the middle index of the sub-array
+ int mid = (left + right) / 2;
+ int leftMin, leftMax, rightMin, rightMax;
+
+ // recursively find min and max in the left and right sub-arrays
+ MinAndMax(arr, left, mid, leftMin, leftMax);
+ MinAndMax(arr, mid + 1, right, rightMin, rightMax);
+
+ // update the minimum and maximum values
+ min = std::min(leftMin, rightMin);
+ max = std::max(leftMax, rightMax);
+}
+
+int main() {
+
+ std::vector<int> arr = {10, 5, 20, 8, 15, 30, -12, 24};
+ int min, max;
+
+ MinAndMax(arr, 0, arr.size() - 1, min, max);
+
+ std::cout << "Minimum element: " << min << std::endl;
+ std::cout << "Maximum element: " << max << std::endl;
+
+ return 0;
+}