Problem Solving

Problems Name

Binery Search

                
                    function binerySearch(nums, target) {
                        for (let i = 0; i < nums.length - 1; i++) {
                            if (nums[i] == target) {
                                return i;
                            }
                        }
                    }
                    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