Search String using binary_search() function in C++ STL Last Updated : 31 May, 2022 Comments Improve Suggest changes Like Article Like Report The in-built STL library function binary_search() for searching whether a given string is present or not in the given string array. Binary search is a divide and conquers approach. The idea behind the binary search algorithm is to keep dividing the array in half until the element is found, or all the elements are exhausted. The middle item of the array is compared with the target value i.e. the value that needs to be searched, if it matches, it returns true otherwise if the middle term is greater than the target, the search is performed in the left sub-array. If the middle item is less than the target, the search is performed in the right sub-array. Example: Input: arr[] = {“Geeks”, “For”, “GeeksForGeek”} Search “Geeks” Output: String Founded in array Syntax: binary_search(starting_address, ending_address, value_of_string) Below is the implementation of the above approach: C++14 // C++ program to implement Binary // Search in Standard Template Library (STL) #include <algorithm> #include <iostream> using namespace std; void show_array(string arr[], int arraysize) { for (int i = 0; i < arraysize; i++) cout << arr[i] << ", "; } void binarySearch(string arr[], int size) { cout << "\nThe array is : \n"; show_array(arr, size); // Sort string array a for binary search as prerequisite sort(arr, arr + size); // Finding for "Geeks" cout << "\n\nSearching Result for \"Geeks\""; if (binary_search(arr, arr + size, "Geeks")) cout << "\nString Founded in array\n"; else cout << "\nString not Founded in array\n"; // Finding for string str string str = "Best"; cout << "\nSearching Result for \"Best\""; if (binary_search(arr, arr + size, str)) cout << "\nString Found in array"; else cout << "\nString not Found in array"; } // Driver code int main() { // Initialising string array a string arr[] = { "Geeks", "For", "GeeksForGeek" }; // Find size of array arr int size = sizeof(arr) / sizeof(arr[0]); // Function call binarySearch(arr, size); return 0; } Output: The array is : Geeks, For, GeeksForGeek, Searching Result for "Geeks" String Founded in array Searching Result for "Best" String not Found in array Time Complexity: O(N*log N), where N represents the number of elements present in the array Auxiliary Space: O(1) Comment More infoAdvertise with us Next Article Search String using binary_search() function in C++ STL A ajaymakvana Follow Improve Article Tags : Searching C++ Programs C++ DSA Binary Search +1 More Practice Tags : CPPBinary SearchSearching Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read C++ Programming Language C++ is a computer programming language developed by Bjarne Stroustrup as an extension of the C language. It is known for is fast speed, low level memory management and is often taught as first programming language. It provides:Hands-on application of different programming concepts.Similar syntax to 5 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example 12 min read Like