another solution for Search in Rotated Sorted Array

Author: rihib

go/search_in_rotated_sorted_array.go

@@ -1,7 +1,7 @@
 //lint:file-ignore U1000 Ignore all unused code
 package main
 
-func searchInRotatedSortedArray(nums []int, target int) int {
+func search_closed(nums []int, target int) int {
 	left, right := 0, len(nums)-1
 	for left <= right {
 		mid := (left + right) / 2
@@ -24,3 +24,27 @@ func searchInRotatedSortedArray(nums []int, target int) int {
 	}
 	return -1
 }
+
+func search_half_closed(nums []int, target int) int {
+	left, right := 0, len(nums)
+	for left < right {
+		mid := (left + right) / 2
+		if target == nums[mid] {
+			return mid
+		}
+		if nums[left] <= nums[mid] {
+			if nums[left] <= target && target < nums[mid] {
+				right = mid
+			} else {
+				left = mid + 1
+			}
+		} else {
+			if nums[mid] < target && target <= nums[right-1] {
+				left = mid + 1
+			} else {
+				right = mid
+			}
+		}
+	}
+	return -1
+}