mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 02:26:28 +08:00
56b20eff36
* .net 8.0 migration * update docs * revert change * revert change and update appendix docs * remove static * Update binary_search_insertion.cs * Update binary_search_insertion.cs * Update binary_search_edge.cs * Update binary_search_insertion.cs * Update binary_search_edge.cs --------- Co-authored-by: Yudong Jin <krahets@163.com>
59 lines
2.2 KiB
C#
59 lines
2.2 KiB
C#
/**
|
|
* File: binary_search.cs
|
|
* Created Time: 2022-12-23
|
|
* Author: haptear (haptear@hotmail.com)
|
|
*/
|
|
|
|
namespace hello_algo.chapter_searching;
|
|
|
|
public class binary_search {
|
|
/* 二分查找(双闭区间) */
|
|
int BinarySearch(int[] nums, int target) {
|
|
// 初始化双闭区间 [0, n-1] ,即 i, j 分别指向数组首元素、尾元素
|
|
int i = 0, j = nums.Length - 1;
|
|
// 循环,当搜索区间为空时跳出(当 i > j 时为空)
|
|
while (i <= j) {
|
|
int m = i + (j - i) / 2; // 计算中点索引 m
|
|
if (nums[m] < target) // 此情况说明 target 在区间 [m+1, j] 中
|
|
i = m + 1;
|
|
else if (nums[m] > target) // 此情况说明 target 在区间 [i, m-1] 中
|
|
j = m - 1;
|
|
else // 找到目标元素,返回其索引
|
|
return m;
|
|
}
|
|
// 未找到目标元素,返回 -1
|
|
return -1;
|
|
}
|
|
|
|
/* 二分查找(左闭右开) */
|
|
int BinarySearchLCRO(int[] nums, int target) {
|
|
// 初始化左闭右开 [0, n) ,即 i, j 分别指向数组首元素、尾元素+1
|
|
int i = 0, j = nums.Length;
|
|
// 循环,当搜索区间为空时跳出(当 i = j 时为空)
|
|
while (i < j) {
|
|
int m = i + (j - i) / 2; // 计算中点索引 m
|
|
if (nums[m] < target) // 此情况说明 target 在区间 [m+1, j) 中
|
|
i = m + 1;
|
|
else if (nums[m] > target) // 此情况说明 target 在区间 [i, m) 中
|
|
j = m;
|
|
else // 找到目标元素,返回其索引
|
|
return m;
|
|
}
|
|
// 未找到目标元素,返回 -1
|
|
return -1;
|
|
}
|
|
|
|
[Test]
|
|
public void Test() {
|
|
int target = 6;
|
|
int[] nums = [1, 3, 6, 8, 12, 15, 23, 26, 31, 35];
|
|
|
|
/* 二分查找(双闭区间) */
|
|
int index = BinarySearch(nums, target);
|
|
Console.WriteLine("目标元素 6 的索引 = " + index);
|
|
|
|
/* 二分查找(左闭右开) */
|
|
index = BinarySearchLCRO(nums, target);
|
|
Console.WriteLine("目标元素 6 的索引 = " + index);
|
|
}
|
|
}
|