From ed0887ddbffeb0fa0e6bbb0c8cfdd62fa7016bc5 Mon Sep 17 00:00:00 2001
From: "go-interview-practice-bot[bot]"
 <230190823+go-interview-practice-bot[bot]@users.noreply.github.com>
Date: Sat, 1 Nov 2025 01:31:36 +0000
Subject: [PATCH] Add solution for Challenge 21

---
 .../submissions/Johrespi/solution-template.go | 86 +++++++++++++++++++
 1 file changed, 86 insertions(+)
 create mode 100644 challenge-21/submissions/Johrespi/solution-template.go

diff --git a/challenge-21/submissions/Johrespi/solution-template.go b/challenge-21/submissions/Johrespi/solution-template.go
new file mode 100644
index 000000000..45d719e7c
--- /dev/null
+++ b/challenge-21/submissions/Johrespi/solution-template.go
@@ -0,0 +1,86 @@
+package main
+
+import (
+	"fmt"
+)
+
+func main() {
+	// Example sorted array for testing
+	arr := []int{1, 3, 5, 7, 9, 11, 13, 15, 17, 19}
+
+	// Test binary search
+	target := 7
+	index := BinarySearch(arr, target)
+	fmt.Printf("BinarySearch: %d found at index %d\n", target, index)
+
+	// Test recursive binary search
+	recursiveIndex := BinarySearchRecursive(arr, target, 0, len(arr)-1)
+	fmt.Printf("BinarySearchRecursive: %d found at index %d\n", target, recursiveIndex)
+
+	// Test find insert position
+	insertTarget := 8
+	insertPos := FindInsertPosition(arr, insertTarget)
+	fmt.Printf("FindInsertPosition: %d should be inserted at index %d\n", insertTarget, insertPos)
+}
+
+// BinarySearch performs a standard binary search to find the target in the sorted array.
+// Returns the index of the target if found, or -1 if not found.
+func BinarySearch(arr []int, target int) int {
+	// TODO: Implement this function
+    low := 0
+    high := len(arr) - 1
+	
+	for low <= high {
+	    mid := low + (high - low)/2
+    	if target == arr[mid]{
+    	    return mid
+    	} else if target > arr[mid]{
+    	    low = mid + 1
+    	} else {
+            high = mid - 1
+    	}
+	}
+	
+	return -1
+}
+
+// BinarySearchRecursive performs binary search using recursion.
+// Returns the index of the target if found, or -1 if not found.
+func BinarySearchRecursive(arr []int, target int, left int, right int) int {
+	// TODO: Implement this function
+	
+	mid := left + (right - left)/2
+	
+	if left > right{
+	    return -1
+	    
+	}
+	
+	if target == arr[mid]{
+	    return mid
+	} else if target > arr[mid]{
+	    return BinarySearchRecursive(arr, target, mid + 1, right)
+	} else {
+	    return BinarySearchRecursive(arr, target, left, mid - 1)
+	}
+}
+
+// FindInsertPosition returns the index where the target should be inserted
+// to maintain the sorted order of the array.
+func FindInsertPosition(arr []int, target int) int {
+	// TODO: Implement this function
+	
+	left := 0
+	right := len(arr) - 1
+	 
+	for left <= right {    
+	    mid := left + (right - left)/2
+	    if target > arr[mid] {
+	        left = mid + 1
+	    } else {
+	        right = mid - 1
+	    }
+	}
+	
+	return left
+}