Find minimum in rotated sorted array

Signed-off-by: begeekmyfriend <[email protected]>

Author: begeekmyfriend

153_find_minimum_in_rotated_sorted_array/Makefile

@@ -0,0 +1,2 @@
+all:
+	gcc -O2 -o test minimum.c

153_find_minimum_in_rotated_sorted_array/minimum.c

@@ -0,0 +1,31 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <limits.h>
+
+static int findMin(int* nums, int numsSize)
+{
+    int lo = 0;
+    int hi = numsSize - 1;
+    int min = INT_MAX;
+    while (lo <= hi) {
+        int mid = lo + (hi - lo) / 2;        
+        min = min < nums[mid] ? min : nums[mid];
+        if (nums[mid] > nums[hi]) {
+            lo = mid + 1;
+        } else {
+            hi = mid - 1;
+        }
+    }
+    return min;
+}
+
+int main(int argc, char **argv)
+{
+    int i, count = argc - 1;
+    int *nums = malloc(count * sizeof(int));
+    for (i = 0; i < count; i++) {
+        nums[i] = atoi(argv[i + 1]);
+    }
+    printf("%d\n", findMin(nums, count));
+    return 0;
+}

154_find_minimum_in_rotated_sorted_array_ii/Makefile

@@ -0,0 +1,2 @@
+all:
+	gcc -O2 -o test minimum.c

154_find_minimum_in_rotated_sorted_array_ii/minimum.c

@@ -0,0 +1,27 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+static int findMin(int* nums, int numsSize)
+{
+    if (numsSize == 1) {
+        return nums[0];
+    }
+    int i, j;
+    for (i = 1; i < numsSize; i++) {
+        if (nums[i] < nums[i - 1]) {
+            return nums[i];
+        }
+    }
+    return nums[0];
+}
+
+int main(int argc, char **argv)
+{
+    int i, count = argc - 1;
+    int *nums = malloc(count * sizeof(int));
+    for (i = 0; i < count; i++) {
+        nums[i] = atoi(argv[i + 1]);
+    }
+    printf("%d\n", findMin(nums, count));
+    return 0;
+}