AlgoStudyGroup
diff --git a/‎May-LeetCoding-Challenge/.DS_Store
Copy file name to clipboard
6 KB b/‎May-LeetCoding-Challenge/.DS_Store
Copy file name to clipboard
6 KB
diff --git a/‎May-LeetCoding-Challenge/First-Bad-Version/analysis.md
Copy file name to clipboard
+36Lines changed: 36 additions & 0 deletions b/‎May-LeetCoding-Challenge/First-Bad-Version/analysis.md
Copy file name to clipboard
+36Lines changed: 36 additions & 0 deletions
diff --git a/‎May-LeetCoding-Challenge/algorithm-description.md
Copy file name to clipboardExpand all lines: May-LeetCoding-Challenge/algorithm-description.md b/‎May-LeetCoding-Challenge/algorithm-description.md
Copy file name to clipboardExpand all lines: May-LeetCoding-Challenge/algorithm-description.md
@@ -0,0 +1,36 @@
+#### Summary
+A direct application of the Binary Search algorithm.
+
+
+#### Template of Binary Search [Pseudo Code]
+```
+int binary_search(int[] arr, int target){
+	int left = ..., right = ... ;
+	while (...){
+		int mid = (right - left) / 2 + left;
+		if (arr[mid] == target){
+			...
+		}
+		else if (arr[mid] < target){
+			left = ...
+		}
+		else if (arr[mid] > target){
+			right = ...
+		}
+	}
+	return ...
+}
+```
+
+#### Remarks
+
+* Use
+```
+mid = (right - left) / 2 + left
+```
+instead of
+```
+mid = (left + right) / 2
+```
+to avoid any overflow in intermediare calculation.
+*