hello-algo/en/codes/dart/chapter_searching/binary_search.dart

64 lines
2.1 KiB
Dart

/**
* File: binary_search.dart
* Created Time: 2023-05-12
* Author: Jefferson (JeffersonHuang77@gmail.com)
*/
/* Binary search (double closed interval) */
int binarySearch(List<int> nums, int target) {
// Initialize double closed interval [0, n-1], i.e., i, j point to the first element and last element of the array respectively
int i = 0, j = nums.length - 1;
// Loop until the search interval is empty (when i > j, it is empty)
while (i <= j) {
int m = i + (j - i) ~/ 2; // Calculate midpoint index m
if (nums[m] < target) {
// This situation indicates that target is in the interval [m+1, j]
i = m + 1;
} else if (nums[m] > target) {
// This situation indicates that target is in the interval [i, m-1]
j = m - 1;
} else {
// Found the target element, thus return its index
return m;
}
}
// Did not find the target element, thus return -1
return -1;
}
/* Binary search (left closed right open interval) */
int binarySearchLCRO(List<int> nums, int target) {
// Initialize left closed right open interval [0, n), i.e., i, j point to the first element and the last element +1 of the array respectively
int i = 0, j = nums.length;
// Loop until the search interval is empty (when i = j, it is empty)
while (i < j) {
int m = i + (j - i) ~/ 2; // Calculate midpoint index m
if (nums[m] < target) {
// This situation indicates that target is in the interval [m+1, j)
i = m + 1;
} else if (nums[m] > target) {
// This situation indicates that target is in the interval [i, m)
j = m;
} else {
// Found the target element, thus return its index
return m;
}
}
// Did not find the target element, thus return -1
return -1;
}
/* Driver Code*/
void main() {
int target = 6;
final nums = [1, 3, 6, 8, 12, 15, 23, 26, 31, 35];
/* Binary search (closed interval) */
int index = binarySearch(nums, target);
print('目标元素 6 的索引 = $index');
/* Binary search (left closed right open interval) */
index = binarySearchLCRO(nums, target);
print('目标元素 6 的索引 = $index');
}