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

Why Binary Search and What Sorted Order Gives You

📖 Scenario: Imagine you have a list of book titles sorted alphabetically on a shelf. You want to find if a certain book is there quickly without checking every book one by one.

🎯 Goal: You will create a sorted list of book titles, set up a target book to find, use binary search to check if the book is in the list, and print the result.

📋 What You'll Learn

Create a sorted vector of strings called books with these exact titles: "Algorithms", "Data Structures", "Networking", "Operating Systems", "Programming"

Create a string variable called target and set it to "Networking"

Use binary search with std::binary_search to check if target is in books

Print "Found" if the book is in the list, otherwise print "Not Found"

💡 Why This Matters

🌍 Real World

Searching sorted data quickly is common in apps like phone contacts, dictionaries, and product catalogs.

💼 Career

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

1

Create the sorted list of books

Create a std::vector<std::string> called books with these exact titles in this order: "Algorithms", "Data Structures", "Networking", "Operating Systems", "Programming"

DSA C++

#include 
#include 
#include 

int main() {
    // Create the sorted vector books here
    // Your code here
    return 0;
}

Hint

Use std::vector<std::string> and initialize it with the given titles in order.

2

Set the target book to find

Create a std::string variable called target and set it to "Networking"

DSA C++

#include 
#include 
#include 

int main() {
    std::vector books = {"Algorithms", "Data Structures", "Networking", "Operating Systems", "Programming"};
    // Create the target string here
    // Your code here
    return 0;
}

Hint

Use std::string target = "Networking"; to set the book you want to find.

3

Use binary search to check if the target is in the list

Use std::binary_search with books.begin(), books.end(), and target to check if the book is in the list. Store the result in a bool variable called found

DSA C++

#include 
#include 
#include 
#include 

int main() {
    std::vector books = {"Algorithms", "Data Structures", "Networking", "Operating Systems", "Programming"};
    std::string target = "Networking";
    // Use binary_search to check if target is in books
    // Your code here
    return 0;
}

Hint

Use bool found = std::binary_search(books.begin(), books.end(), target); to check presence.

4

Print the search result

Use if to check found. Print "Found" if true, otherwise print "Not Found"

DSA C++

#include 
#include 
#include 
#include 

int main() {
    std::vector books = {"Algorithms", "Data Structures", "Networking", "Operating Systems", "Programming"};
    std::string target = "Networking";
    bool found = std::binary_search(books.begin(), books.end(), target);
    // Print "Found" if found is true, else print "Not Found"
    // Your code here
    return 0;
}

Hint

Use if (found) std::cout << "Found"; else print "Not Found".