Problem Solving

Binery Search With While Loop

                
                    function binerySearch(nums, target) {
                        let min = 0;
                        let max = nums.length - 1;
            
                        while (min <= max) {
                            let midIndex = Math.floor((max + min) / 2);
            
                            if (nums[midIndex] < target) {
                                min = midIndex + 1;
                            } else if (nums[midIndex] > target) {
                                max = midIndex - 1;
                            } else {
                                return midIndex;
                            }
                        }
                    }
                    console.log(binerySearch([2, 3, 6, 8, 20], 6)); // 2 
                    console.log(binerySearch([5, 23, 36, 48, 220, 500], 48)); // 3 
                    console.log(binerySearch([5, 26, 66, 98, 420, 800], 26)); // 1