Binary Search Techniques and Applications
This week's practice focuses on mastering binary search algorithms through LeetCode problems.
The first problem is Binary Search. Below is the implementation:
int search(int* nums, int numsSize, int target) {
int left = 0;
int right = numsSize - 1;
while (left <= right) {
int mid = left + (right - left) / 2;
if ( ...
Posted on Mon, 08 Jun 2026 18:45:49 +0000 by canabatz