Searching in C++: Sequential Searching and Binary Searching

(Last Updated On: April 4, 2021)

Searching in one-dimensional array:

Searching in C++, this is the process of finding a certain data item from a given list of values, this process is called searching. The searching process is considered successful if the specified data item is successfully found during the searching process in C++ otherwise, if the specified data item is not found then the result is declared unsuccessful. The search operation comes to an end or is terminated when the specified item is found. This may also be possible that more than one instance of the searched item may be present in the provided list.

A variety of search methods can be used (depending on the situation) for searching information. The most commonly used types of the searches methods are given below.

  • Sequential search and
  • Binary search


Amazon Purchase Links:

Top Gaming Computers

Best Laptops

Best Graphic Cards

Portable Hard Drives

Best Keyboards

Best High Quality PC Mic

Computer Accessories

*Please Note: These are affiliate links. I may make a commission if you buy the components through these links. I would appreciate your support in this way!

Sequential Search:

Sequential search is also known as linear search or serial. The Sequential search method is a very simple and straightforward technique to search a specified data item in an unordered list. The data to be found is searched in the list sequentially, i.e. starting from the first data item up to the required data item of the list in a sequence.

Using sequential search, the following procedure is adopted:

  • The desired search value is compared with the first value in the list. If the required value matches with the first value, the search operation is declared successful and is stops. Suppose we want to search value 63 in the list of value as shown in the figure given below. This value exists at location 6 and 9. The search operation is terminated at position 6.

Searching in C++

  • If the desired value doesn’t match with the first value of the list, it is compared with the second value. The search cycle proceeds till the value is found or end of the list is reached. Assume we need to search 66 in the list of values as appeared in figure. This value doesn’t exist in the list as given underneath. The search operation is ended toward the end of the list and is terminated.

Searching in C++

The sequential search is slow and is used for an only a small list of data. This method is not recommended for a large amount of data because some more efficient method is available for large and complex search.



Example: how to use sequential searching in C++ for search a value in an array list and display their position on the screen:

Searching in C++

When the element not found in the list

Searching in C++

Example: how to find maximum value and its location in the array using sequential Searching in C++:

Searching in C++


Binary Searching in C++:

The Binary searching technique is used to search the desired data value or item in an ordered list(i.e the values sorted in ascending or descending order). In C++ as compared to the Sequential searching the binary Searching in C++ is very fast. It is used to search large-size list to find a specific value.

In binary searching, the search process is started from the middle of the sorted list. If the required value is in the middle of the list then searching process is successful and is stopped at that point; otherwise one of two halves of the list is selected for further Searching in C++. The main purpose of the binary search is to repeatedly cut a given list into two halves with every comparison.

Suppose an array “abc” with 10 values in sorted order as shown in the following figure

Searching in C++

The following steps explain the binary Searching in C++ for finding a specific value in the above array. Suppose we want to search the value 12 in the above array.

Step-1:

Divide the array into two halves such as mid =(start + end)/2. In the above case, the value of start is 0, while the end is 9. So the value of mid is 4. The value mid[4] (i.e. 23) is greater than 12. The required value (i.e. 12) exists on the left half side of the array, i.e. 0 to 3.

Step-2:

Divide again left side of the array from 0 to 3. In this case, new values of start and end are 0 and 3 (end = mid-1) respectively. Mid = (start + end)/2. So the new value of mid is 1. The value of mid[1] (i.e. 4) is less than 12. The required value (i.e. 12 ) exists on the right half side, i.e. 2 to 3.

Step-3:

Divide again array from 2 to 3. In this case, new values of start and end are 2 and 3 (start = mid +1) respectively. Mid = (start+end)/2. So the new value of mid is 2. The value of mid[2] (i.e. 7) is less than 12. The required value (i.e. 12) exists on the right half side, i.e. 3 to 3.

Step-4:

Divide again array from 3 to 3. In this case, new values of start and end are 3 and 3 (start = mid + 1) respectively. Mid = (start + end)/2. So the new values of mid is 3. The value of mid[3] (i.e. 12) is equal to 12.t the new value is located at position3. The search process is terminated.

Searching in C++


Example: write a program that initialize data into one-dimensional array and searches the value in the array using binary searching in c++:

Searching in C++

When value not found in array, the following output will display

Searching in C++

Recommended For You

About the Author: Engr Fahad

My name is Shahzada Fahad and I am an Electrical Engineer. I have been doing Job in UAE as a site engineer in an Electrical Construction Company. Currently, I am running my own YouTube channel "Electronic Clinic", and managing this Website. My Hobbies are * Watching Movies * Music * Martial Arts * Photography * Travelling * Make Sketches and so on...

Leave a Reply