feat: wednesday

pkg/find_minimum_in_rotated_sorted_array/main.go

@@ -0,0 +1,13 @@
+package findminimuminrotatedsortedarray
+
+func FindMin(nums []int) int {
+	middle := len(nums) / 2
+
+	if nums[0] > nums[middle] {
+		return FindMin(nums[1 : middle+1])
+	} else if nums[middle] > nums[len(nums)-1] {
+		return FindMin(nums[middle+1:])
+	} else {
+		return nums[0]
+	}
+}