Why Binary Search and What Sorted Order Gives You in DSA Javascript - See It Work

Why Binary Search and What Sorted Order Gives You

📖 Scenario: Imagine you have a sorted list of book titles in a library catalog. You want to find if a certain book is available quickly without checking every title one by one.

🎯 Goal: You will build a simple program that uses binary search on a sorted list of book titles to find if a specific book is in the catalog.

📋 What You'll Learn

Create a sorted array of book titles

Set a target book title to search for

Implement binary search logic to find the target

Print whether the book was found or not

💡 Why This Matters

🌍 Real World

Binary search is used in many apps and systems to quickly find data in sorted lists, like searching contacts, files, or products.

💼 Career

Understanding binary search and sorted data is essential for software developers to write efficient search functions and optimize performance.

1

Create a sorted array of book titles

Create a variable called books and assign it the sorted array ["Algorithms", "Data Structures", "JavaScript Basics", "Python Essentials", "Web Development"].

DSA Javascript

// Your code here

Hint

Remember to keep the array sorted as given.

2

Set the target book title to search for

Create a variable called target and assign it the string "Python Essentials".

DSA Javascript

const books = ["Algorithms", "Data Structures", "JavaScript Basics", "Python Essentials", "Web Development"];
// Your code here

Hint

Use the exact string "Python Essentials" for the target.

3

Implement binary search logic

Write a function called binarySearch that takes arr and target as parameters. Use variables left, right, and mid to perform binary search on the sorted array. Return true if target is found, otherwise false.

DSA Javascript

const books = ["Algorithms", "Data Structures", "JavaScript Basics", "Python Essentials", "Web Development"];
const target = "Python Essentials";

// Your code here

Hint

Use a while loop to narrow down the search range until you find the target or the range is empty.

4

Print whether the book was found

Use console.log to print "Found" if binarySearch(books, target) returns true, otherwise print "Not Found".

DSA Javascript

const books = ["Algorithms", "Data Structures", "JavaScript Basics", "Python Essentials", "Web Development"];
const target = "Python Essentials";

function binarySearch(arr, target) {
    let left = 0;
    let right = arr.length - 1;
    while (left <= right) {
        let mid = Math.floor((left + right) / 2);
        if (arr[mid] === target) {
            return true;
        } else if (arr[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }
    return false;
}

// Your code here

Hint

Use an if-else statement to print the correct message based on the search result.