ProDeveloperTutorial.com

Tutorials and Programming Solutions
Menu
  • Shell Scripting
  • System Design
  • Linux System Programming
  • 4g LTE
  • Coding questions
  • C
  • C++
  • DSA
  • GIT
  • 450 DSA Cracker
  • 5G NR
  • O-RAN

Searching Algorithm 5: Exponential Search

prodevelopertutorial September 8, 2019

Introduction:

Exponential search is an improvement to binary search. We use this algorithm when we have large amount of data.

Explanation:

In exponential search algorithm we use binary search. But the difference is, we get the range of elements to search from and give that as input to binary search.
Now how do we select the range of elements?
Initially we start with “1”. Then for each pass, we increase the gap 2 times everytime.
Once we get our range, we give that range as input to binary search.

Pseudo Code will be as below:

int exponential_search(arr[], int size, int key)
{

    int bound = 1;
    while (bound < size && arr[bound] < key) 
    {
    //for every pass, increase the gap 2 times.
        bound *= 2;
    }

    return binary_search(arr, key, bound/2, min(bound + 1, size));
}

 

Let us understand this algorithm with the help of an example
Consider the array:
arr[] = {1, 2, 3, 4, 5, 6, 7, 8};
and the search key = 7;
Initially, the bound value will be 1 for pass 1, now check “bound < size && arr[bound] < key” ? It is true. because bound = 1 that is less than 8 and arr[1] < key.
Now, the bound value will be 2 for pass 2, now check “bound < size && arr[bound] < key” ? It is true. because bound = 2 that is less than 8 and arr[2] < key.
Now, the bound value will be 4 for pass 3, , now check “bound < size && arr[bound] < key” ? It is true. because bound = 4 that is less than 8 and arr[4] < key.
Now, the bound value will be 8 for pass 4, now check “bound < size && arr[bound] < key” ? It is false. because bound = 8 that is not less than 8. Hence exit the loop.
Then we perform binary search by calling binary_search(arr, key, bound/2, min(bound + 1, size)).
as bound is 8, bound/2 = 4.
min(8+1, 8) = 8
Now we will call binary search as binary_search(arr, 7,  4, 8);
Now we know the exact range of elements where our key element is present. Now we perform binary search on that range and return if we found the element or not.

Implementation of Exponential Search in C++

#include<iostream>
#include <vector>

using namespace std;


void binarySearch(int arr[], int start, int end, int key) 
{ 
  if (end >= start) 
  { 
    int mid = start + (end - start)/2; 

    if (arr[mid] == key)
    {
      cout<<"Element found"<<endl;
      return; 
    }

    if (arr[mid] > key) 
      return binarySearch(arr, start, mid-1, key); 

    return binarySearch(arr, mid+1, end, key); 
  }

  cout<<"Element NOT found"<<endl;
  return; 
} 



void exponential_search(int arr[], int size, int key) 
{ 
  if (arr[0] == key)
  {
    cout<<"Element found"<<endl;
    return; 
  }

  int bound = 1; 
  while (bound < size && arr[bound] <= key)
  {
    cout<<"Bound = "<<bound<<endl;
    bound = bound*2; 
  }

  binarySearch(arr, bound/2,  min(bound + 1, size), key);
  return; 
} 


int main() 
{  
    int arr[] = {1, 2, 3, 4, 5, 6, 7, 8};
    int len = 8;
    int key = 7;

    exponential_search(arr, len, key);

    return 0; 
}

Output:

Element found

The time complexity of the algorithm will be O(log i) at worst case.

Further Reading:

AJ’s definitive guide for DS and Algorithms. Click here to study the complete list of algorithm and data structure tutorial. 85+ chapters to study from.

List Of Tutorials available in this website:

C Programming 20+ ChaptersC++ Programming 80+ Chapters
100+ Solved Coding QuestionsData Structures and Algorithms 85+ Chapters
System design 20+ ChaptersShell Scripting 12 Chapters
4g LTE 60+ ChaptersMost Frequently asked Coding questions
5G NR 50+ ChaptersLinux System Programming 20+ chapters
Share
Email
Tweet
Linkedin
Reddit
Stumble
Pinterest
Prev Article
Next Article

About The Author

prodevelopertutorial

Follow this blog to learn more about C, C++, Linux, Competitive Programming concepts, Data Structures.

Leave a Reply Cancel Reply

You must be logged in to post a comment.

ProDeveloperTutorial.com

Tutorials and Programming Solutions
Copyright © 2023 ProDeveloperTutorial.com
We use cookies on our website to give you the most relevant experience by remembering your preferences and repeat visits. By clicking “Accept”, you consent to the use of ALL the cookies.
Do not sell my personal information.
Cookie SettingsAccept
Manage consent

Privacy Overview

This website uses cookies to improve your experience while you navigate through the website. Out of these, the cookies that are categorized as necessary are stored on your browser as they are essential for the working of basic functionalities of the website. We also use third-party cookies that help us analyze and understand how you use this website. These cookies will be stored in your browser only with your consent. You also have the option to opt-out of these cookies. But opting out of some of these cookies may affect your browsing experience.
Necessary
Always Enabled
Necessary cookies are absolutely essential for the website to function properly. These cookies ensure basic functionalities and security features of the website, anonymously.
CookieDurationDescription
cookielawinfo-checkbox-analytics11 monthsThis cookie is set by GDPR Cookie Consent plugin. The cookie is used to store the user consent for the cookies in the category "Analytics".
cookielawinfo-checkbox-functional11 monthsThe cookie is set by GDPR cookie consent to record the user consent for the cookies in the category "Functional".
cookielawinfo-checkbox-necessary11 monthsThis cookie is set by GDPR Cookie Consent plugin. The cookies is used to store the user consent for the cookies in the category "Necessary".
cookielawinfo-checkbox-others11 monthsThis cookie is set by GDPR Cookie Consent plugin. The cookie is used to store the user consent for the cookies in the category "Other.
cookielawinfo-checkbox-performance11 monthsThis cookie is set by GDPR Cookie Consent plugin. The cookie is used to store the user consent for the cookies in the category "Performance".
viewed_cookie_policy11 monthsThe cookie is set by the GDPR Cookie Consent plugin and is used to store whether or not user has consented to the use of cookies. It does not store any personal data.
Functional
Functional cookies help to perform certain functionalities like sharing the content of the website on social media platforms, collect feedbacks, and other third-party features.
Performance
Performance cookies are used to understand and analyze the key performance indexes of the website which helps in delivering a better user experience for the visitors.
Analytics
Analytical cookies are used to understand how visitors interact with the website. These cookies help provide information on metrics the number of visitors, bounce rate, traffic source, etc.
Advertisement
Advertisement cookies are used to provide visitors with relevant ads and marketing campaigns. These cookies track visitors across websites and collect information to provide customized ads.
Others
Other uncategorized cookies are those that are being analyzed and have not been classified into a category as yet.
SAVE & ACCEPT