EDUCBA

EDUCBA

MENUMENU
  • Free Tutorials
  • Free Courses
  • Certification Courses
  • 600+ Courses All in One Bundle
  • Login
Home Software Development Software Development Tutorials Software Development Basics Binary search with recursion
Secondary Sidebar
Software Development Basics
  • Basics
    • Microsoft Expression Web
    • IDE
    • Microsoft Flow
    • Unity Dashboard
    • Servlet Dispatcher
    • Types of Algorithms
    • Vue.js? nextTick
    • Vue.js Transition
    • Page Replacement Algorithms
    • What is CLI
    • Open Source Software
    • Solve Problems With Technology (Simple)
    • What is Application Software & Types
    • Microsoft Word Alternative
    • ADDIE Model
    • V-model advantages and disadvantages
    • Gatsby Plugins
    • Putty version
    • Xampp versions
    • Avro converter
    • Avro Data Types
    • Avro Schema Evolution
    • Avro Serialization
    • Cloudera Impala
    • Cloudera Careers
    • Entity Framework Core
    • Gulp File Include
    • Gulp Autoprefixer
    • Gulp File
    • Gulp Terser
    • System Software Tools
    • System Software Components
    • Typography App
    • Software as a Service (Saas)
    • Icon Font Pack
    • Interpret Results Using ANOVA Test
    • Blogging Insights Your Analytics
    • Increase Productivity Technology
    • Free Multimedia Software
    • Information Technology Benefits
    • What is SPSS and How Does It Work
    • Learn to Code For Beginners (Advance)
    • Uses of Coding
    • Uses Of Raspberry Pi
    • What Is System Design
    • Introduction to NLP
    • What is MapReduce
    • What is SoapUI
    • What is MVC
    • What is Multithreading
    • What is Neural Networks
    • What is Swift
    • What is PLC
    • What is Open Cart
    • What is Mainframe
    • What is JMS
    • What is Cognos
    • What is Open Source
    • What is Bot
    • What is SOAP
    • What is COBOL
    • What is GraphQL
    • What is Microcontroller
    • What is Open-Source License
    • What is Visual Studio Code
    • What is Pandas
    • What is Hypervisor
    • What is Common Gateway Interface
    • What is IDE?
    • What is MVC Design Pattern
    • What is Application Server
    • What is GPS
    • What is Botnet
    • What is Assembly Language
    • System Analysis And Design
    • HTTP Caching
    • What is Buffer Overflow
    • What is Ajax
    • What is Appium
    • What is SVN
    • What is SPSS
    • What is WCF
    • What is Groovy
    • What is Clickbait
    • What is SOA
    • What is GUI
    • What is FreeBSD
    • What is WebSocket
    • What is WordPress
    • What is OSPF
    • What is Coding
    • What is Raspberry Pi
    • HTTP Cookies
    • What is Hub?
    • What is Bridge
    • What is Switch
    • What is Internet Application
    • What is Sensors
    • What is Proximity Sensors
    • What is Full Stack
    • System Design Interview Questions
    • What is Salesforce technology
    • What is Salesforce Sales Cloud
    • What is OOP
    • What is CMD
    • What is React
    • React Redux Typescript
    • What is DSS
    • What is SVG
    • SVG File
    • Bash Sleep Command
    • What is MTU
    • What is Apex
    • What is Desktop Software
    • Tor Browser, Anonymity and Other Browsers
    • Avoid Pitfalls of Shadow IT
    • Freelance Web Graphic Designer
    • What is Storage Virtualization
    • What is Web Services?
    • What is Social Networking?
    • What is Microservices Architecture?
    • Microservices Tools
    • Advantages of Microservices
    • Uses of Internet
    • Software Platforms
    • Uses of Internet for Business
    • Architecture of Web Services
    • Web Application Testing
    • Advantages of Web Service
    • CPU Virtualization
    • Types of Web Services
    • Web Services Testing
    • What is RabbitMQ?
    • RabbitMQ Architecture
    • Advantages of Bitcoin
    • LINQ foreach
    • Penetration Testing Services
    • Puppet Alternatives
    • What is Memcached?
    • What is Browser?
    • Types of Satellites
    • Model Driven Architecture
    • Types of Variables in Statistics
    • Best Statistics Certifications
    • Integration Architecture
    • What is API Integration?
    • What is Grid Computing?
    • Asus File Manager
    • What is GPRS?
    • What is Gradle?
    • What is Basecamp?
    • Software System Architecture
    • GSM Architecture
    • What is Nagios?
    • AppDynamics Tool
    • Logical Architecture
    • What is Microsoft Planner
    • What is Circuit Switching
    • What is ARM?
    • Embedded Control Systems
    • Embedded System Programming
    • Embedded System Development
    • Embedded Systems Software
    • Embedded System Project
    • Types of Embedded Systems
    • Requirement Engineering
    • Types of Engineering
    • What is WAP
    • What is Registry?
    • What is Dynatrace?
    • What is Digital Forensics?
    • Hardware Virtualization
    • AppDynamics Careers
    • Bandwidth Monitoring Tools
    • Ping Monitor Tools
    • Dynatrace Tools
    • What is Trello?
    • What is AppDynamics?
    • What is Remote Desktop?
    • What is Extranet?
    • What is LTE Network?
    • What is Firebase?
    • Website Monitoring Tool
    • Number Systems
    • Service Desk Manager
    • Static Website
    • Dynamic Website
    • What is Email?
    • What is URL Link?
    • What is Program?
    • What is Lock Screen?
    • What is Grafana
    • Unguided Media Transmission
    • IT Governance
    • IT Governance Framework
    • Remote Support Softwares
    • What is Unification?
    • Topological Map
    • What is LAMP?
    • USB Flash Drive
    • Software Development Models
    • Digital Circuit
    • What is Webpack?
    • Fault Tolerance
    • What is DSL Modem?
    • What is Mozilla Firefox?
    • What is Vagrant?
    • Types of Research Methodology
    • Grafana Plugins
    • Ionic Components
    • Nginx Error_page
    • Nginx Include
    • Nginx Version
    • Nginx Force HTTPS
    • Nginx Environment Variables
    • Nginx Container
    • RabbitMQ Routing Key
    • CakePHP
    • Telegram Features
    • What is CDN
    • RethinkDB
    • Symfony Version
    • UWP
    • cPanel version
    • What is assembly?
    • Seed7
    • Switching Techniques
    • OCaml
    • Pseudocode?Algorithm
    • Quality Control Methods
    • What is OneNote?
    • Workstation Uses
    • Soft Computing Techniques
    • Remote Access Software
    • Remote Desktop Tools
    • OneNote Shortcuts
    • Software Review
    • What is Qubit?
    • Static Analysis Tools
    • Register in Microprocessor
    • What is VDI?
    • What is Svelte?
    • RabbitMQ Version
    • Groovy Version
    • Code Walkthrough
    • What is Telegram?
    • Gradle Version
    • What is Recycle Bin?
    • What is Cordova?
    • Swagger version
    • Doxygen
    • Phalcon
    • Metasploit Framework
    • Microsoft Word Shortcut Keys
    • Wordpad shortcut keys
    • Burp Suite
    • Google Docs Shortcuts
    • Install VPN
    • Frontend Challenges
    • CodeIgniter Version
    • VMware Tools
    • CDMA Advantages
    • CDMA Uses
    • Servlet Session Management
    • ServletConfig
    • Servlet Class
    • Log4j Version
    • Remote Desktop Softwares
    • Soapui Load Test
    • Scikit Learn Version
    • VMware Benefits
    • Google Slides Shortcuts
    • What is XAMPP?
    • What is PyGTK?
    • VMware Fusion
    • What is cPanel?
    • Ubuntu Version
    • Server Types
    • App Analytics Tools
    • DNS Types
    • Evernote Features
    • Restful architecture
    • GNOME Keyboard Shortcuts
    • AngelScript
    • NativeScript Layouts
    • PowerPoint Version
    • setInterval Function
    • Shopify Apps
    • TypeScript foreach loop
    • Socio Technical System
    • PowerPoint Shortcut Keys
    • Civil Engineering Tools
    • OpenLayers vs Leaflet
    • Circuit Switching Advantages and Disadvantages
    • LotusScript
    • Multiplexer
    • Multiple Access Protocol
    • Types of Broadband
    • What is Standardization
    • Methods of Development
    • Software Requirement Specification
    • CentOS restart network
    • Bouncy numbers
    • Burp suite proxy
    • Redshift window functions
    • Mesh Topology Advantages and Disadvantages
    • What is Zabbix?
    • Test Techniques
    • Test Development
    • What is PyCharm
    • What is REST
    • JDBC version
    • System software features
    • Ableton versions
    • Unreal engine version
    • RAD advantage disadvantage
    • Incremental Model Advantage and Disadvantage
    • Disadvantages of Internet
    • What is VoIP
    • WAP Architecture
    • CentOS unzip
    • Cubase Shortcuts
    • Cubase Versions
    • Libreoffice shortcut keys
    • Archiving Software
    • Layered Architecture
    • Coverage Types
    • What is Kivy?
    • Types of Methodology
    • Swift JSON
    • JSON Serialize
    • TypeScript?boolean
    • TypeScript keyof object
    • TypeScript RegEx
    • TypeScript?date
    • TypeScript object
    • CentOS Version
    • XSLT if else
    • Binary Search JavaScript
    • Binary search with recursion
    • PLSQL Replace
    • Evernote Notes
    • Rust vs Python
    • Test Scenario
    • Deadlock in Operating System
    • MVVM Architecture
    • MVVM Flutter
    • What is Keyboard
    • WordPress Hosting
    • Software requirement
    • CentOS Add User to Group
    • Backup Types
    • Firewall Rules
    • Microprocessor Features
    • Maven Versions
    • OneNote features
    • Binary search tree insertion
    • Quick sort algorithm
    • B+ tree insertion
    • What is Automation?
    • What is Digital Electronics?
    • Wireless Transmission Media
    • Border Gateway Protocol
    • Email Encryption Software
    • Endpoint Encryption
    • Outlook Alternative
    • What is Abacus
    • Encapsulation Benefits
    • FL Studio Keyboard Shortcuts
    • NordVPN Features
    • Statsmodels API
    • Statsmodels Linear Regression
    • Buzz number
    • Krishnamurthy Number
    • What is Compact Disc?
    • Bucket Sort Algorithm
    • Insertion Sort Algorithm
    • Redis Version
    • Chatbot Benefits
    • Full Stack Technologies
    • Civil Engineering Types
    • Tomcat Web Server
    • Tomcat Native
    • Tkinter Scrolledtext
    • Anaconda Navigator
    • UML Class Diagram
    • System Monitoring Tool
    • Drupal Features
    • Drupal Free Themes
    • Drupal Modules
    • Drupal 9
    • Drupal Developer
    • Drupal Webform
    • Drupal 8
    • Drupal 8 Themes
    • Drupal Views
    • System Software Functions
    • What is Linker?
    • What is K Map?
    • Website Testing Tool
    • TypeScript map
    • TypeScript enum
    • TypeScript class
    • Hill Climbing Algorithm
    • Hashmap and Hashtable
    • Nexus Plugin
    • Entity Framework Delete by ID
    • What is NumPy?
    • What is NLP?
    • Vishing Attack
    • Test Plan in Software Testing
    • Guest Mode
    • What is Mockito?
    • Advantage of the Internet
    • SVG Creator
    • Rails Logger
    • Intellij Plugins
    • Intellij Shortcuts
    • IntelliJ Maven
    • IntelliJ JavaFX
    • IntelliJ Lombok Plugin
    • IntelliJ Format Code
    • IntelliJ gitignore
    • IntelliJ Find and Replace
    • RESTEasy

Related Courses

Software Testing Training

Selenium Training Certification

Appium Training

JMeter Certification Training

Binary search with recursion

Binary search with recursion

Introduction to Binary search with recursion

Binary search is a searching algorithm, in which finds the location of the target value in an array. It is also called a half interval search or logarithmic search. In the searching algorithm, we search any element in the array and return the position of an element in the array. The basic search algorithm is Linear Search, in which we compare every element in an array linearly with the target element. In the Binary Search algorithm, we take a sorted array and compare it with the middle of the array. If we don’t find the target element, we divide it by middle and search in half array accordingly until we get the target element. The time complexity of the Binary Search algorithm is O (log N). where as in linear search, it was O(N), where is N is the size of the array. The base of the log is always 2. In this topic, we are going to learn about Binary search with recursion.

How to perform binary search tree insertion?

To perform a binary search, it is a condition that the array should be sorted; in a sorted array, we compare the middle value of the array with the target value.

If the middle value is greater than the target value, then it means that the target value is the left side of the middle value because the array is sorted so we find the target value in the left half of the array and again compare it with the middle of the left half array.

If the middle value is smaller than the target value, then it means that the target value is the right side of the middle value because an array is sorted, so we find the target value in the right half of the array and again compare it with the middle of the right array.

Start Your Free Software Development Course

Web development, programming languages, Software testing & others

All in One Software Development Bundle(600+ Courses, 50+ projects)
Python TutorialC SharpJavaJavaScript
C Plus PlusSoftware TestingSQLKali Linux
Price
View Courses
600+ Online Courses | 50+ projects | 3000+ Hours | Verifiable Certificates | Lifetime Access
4.6 (86,697 ratings)

If the middle value is equal to the target value, then we simply return the middle.

For binary search, create function we take an array, starting index, ending index of the array and target value. Initial pass the 0 as starting index and N-1 as ending index where N is the size of the array. In binary search, first, we get the middle index of the array using this equation: –

Middle = starting index + (ending index – starting index) / 2

After getting middle, we compare the target value with the value at the middle index; if the value at the middle index is greater, we call the binary search function recursively and pass the same starting index and update the ending index with middle-1. If the value at the middle index is smaller, then we call the binary search function recursively and pass the starting index as middle+1, and the ending index will be the same.

If, in any case ending index is less than starting index, that means the target value is not present in the array, so we will return -1 in that case.

Examples of Binary search with recursion

To understand completely binary search, we will take two examples: –

  1. When the target value is in the Array. Let’s take this below array, and the target value is 9.

Binary search with recursion output 1

Step 1. Call the function binarySearch and pass the required parameter in which the target value is 9, starting index and ending index of the array is 0 and 8.

Step 2. As we see that the starting index is lesser than the ending index, we find the middle using this equation. Middle = starting index + (ending index – starting index) / 2.

Middle = 0 (8-0)/2 = 4

Step 3. Compare the Target value with arr[4]. arr[4] is 21, which is greater than the target value, so we call the recursively binarySearch function and pass the starting index the same, but the ending index will be the middle -1.

Step 4. As the starting index is 0 and the ending index is 3, the middle index will be 1.

Step 5. Compare the Target value with arr[1]. Arr[1] is 5, which is smaller than the target value, so we call recursively binarySearch function and the pass the starting index middle +1 because here arr[middle] is smaller and the ending index will be the same.

Step 6. As the starting index is 2 and the ending index is 3, the middle index will be 2.

Step 7. Compare the Target value with arr[2]. Arr[2] is 9, now target value and arr[middle] is same. So now, we simply return to the middle.

So this is how we will get the index of the target value. And then print the position of the target value.

  1. When the target value is not in the array, Let’s take 11 as a target value which is not present in the array.

Step 1. Call the function binarySearch and pass the required parameter in which target value is 11, starting index and ending index of an array is 0 and 8.

Step 2. As we see that the starting index is lesser than the ending index, we find the middle using this equation. Middle = starting index + (ending index – starting index) / 2.

Middle = 0 (8-0)/2 = 4

Step 3. Compare the Target value with arr[4]. arr[4] is 21, which is greater than the target value, so we call recursively binarySearch function and the pass the starting index same but ending index will the middle -1.

Step 4. As the starting index is 0 and the ending index is 3, the middle index will be 1.

Step 5. Compare the Target value with arr[1]. Arr[1] is 5, which is smaller than the target value, so we call the recursively binarySearch function and the pass the starting index middle +1 because here arr[middle] is smaller and the ending index will be the same.

Step 6. As the starting index is 2 and the ending index is 3, the middle index will be 2.

Step 7. Compare the Target value with arr[2]. Arr[2] is 9, now target value is greater than arr[middle]. So we again call recursively binarySearch and pass the starting index middle +1, which is 3, and the ending index will be the same as 3.

Step 8. Here ending index is not less than starting index, so we find the middle of starting index and ending index. The middle will be 3, arr[3] is 13, which is greater than the target value. So we again call recursively binarySearch and pass the starting index as same and ending index as middle -1, which is 2.

Step 9. Here we get that starting index is 3 and the ending index is 2, which is lesser, So we will return -1, which means the target value is not in the array.

Implementation:

When the target value is present

#include<bits/stdc++.h>
using namespace std;
int binarySearch(int arr[], int target, int start, int end) {
if( end >= start) {
int middle = start + (end - start)/2;
if( arr[middle] == target ) {
return middle;
}
if( arr[middle] > target ) {
return binarySearch(arr, target, start, middle-1);
}
return binarySearch(arr, target, middle+1, end);
}
return -1;
}
int main() {
int arr[] = { 2, 5, 9, 13, 21, 39, 50, 55, 60 };
int N = sizeof(arr)/sizeof(arr[0]);
int res = binarySearch(arr, 9, 0, N-1 );
if(res == -1) {
cout << "Target value Not Found" << endl;
}
else {
cout << "Position of target value is " << res+1 << endl;
}
}

Output:-

Binary search with recursion output 2

Implementation:-

When the target value is not present

#include<bits/stdc++.h>
using namespace std;
int binarySearch(int arr[], int target, int start, int end) {
if( end >= start) {
int middle = start + (end - start)/2;
if( arr[middle] == target ) {
return middle;
}
if( arr[middle] > target ) {
return binarySearch(arr, target, start, middle-1);
}
return binarySearch(arr, target, middle+1, end);
}
return -1;
}
int main() {
int arr[] = { 2, 5, 9, 13, 18, 31, 39, 50, 55, 60 };
int N = sizeof(arr)/sizeof(arr[0]);
int res = binarySearch(arr, 11, 0, N-1 );
if(res == -1) {
cout << "Target value Not Found" << endl;
}
else {
cout << "Position of target value is " << res+1 << endl;
}
}

Output:-

output 3

Conclusion

Binary Search required a sorter array, but here time complexity is better than linear searching. Similar to binary search, there is another algorithm called Ternary Search, in which the first array is in increasing order than decreasing order.

Recommended Articles

This is a guide to Binary search with recursion. Here we discuss How to perform binary search tree insertion along with the examples and outputs. You may also have a look at the following articles to learn more –

  1. Binary Search C++
  2. BinaryWriter in C#
  3. C# BinaryReader
  4. Binary Search Tree Types
Popular Course in this category
Software Testing Training (11 Courses, 2 Projects)
  11 Online Courses |  2 Hands-on Projects |  65+ Hours |  Verifiable Certificate of Completion
4.5
Price

View Course

Related Courses

Selenium Automation Testing Training (11 Courses, 4+ Projects, 4 Quizzes)4.9
Appium Training (2 Courses)4.8
JMeter Testing Training (3 Courses)4.7
0 Shares
Share
Tweet
Share
Primary Sidebar
Footer
About Us
  • Blog
  • Who is EDUCBA?
  • Sign Up
  • Live Classes
  • Corporate Training
  • Certificate from Top Institutions
  • Contact Us
  • Verifiable Certificate
  • Reviews
  • Terms and Conditions
  • Privacy Policy
  •  
Apps
  • iPhone & iPad
  • Android
Resources
  • Free Courses
  • Java Tutorials
  • Python Tutorials
  • All Tutorials
Certification Courses
  • All Courses
  • Software Development Course - All in One Bundle
  • Become a Python Developer
  • Java Course
  • Become a Selenium Automation Tester
  • Become an IoT Developer
  • ASP.NET Course
  • VB.NET Course
  • PHP Course

ISO 10004:2018 & ISO 9001:2015 Certified

© 2022 - EDUCBA. ALL RIGHTS RESERVED. THE CERTIFICATION NAMES ARE THE TRADEMARKS OF THEIR RESPECTIVE OWNERS.

EDUCBA
Free Software Development Course

C# Programming, Conditional Constructs, Loops, Arrays, OOPS Concept

*Please provide your correct email id. Login details for this Free course will be emailed to you

By signing up, you agree to our Terms of Use and Privacy Policy.

EDUCBA Login

Forgot Password?

By signing up, you agree to our Terms of Use and Privacy Policy.

EDUCBA
Free Software Development Course

Web development, programming languages, Software testing & others

*Please provide your correct email id. Login details for this Free course will be emailed to you

By signing up, you agree to our Terms of Use and Privacy Policy.

EDUCBA

*Please provide your correct email id. Login details for this Free course will be emailed to you

By signing up, you agree to our Terms of Use and Privacy Policy.

Let’s Get Started

By signing up, you agree to our Terms of Use and Privacy Policy.

This website or its third-party tools use cookies, which are necessary to its functioning and required to achieve the purposes illustrated in the cookie policy. By closing this banner, scrolling this page, clicking a link or continuing to browse otherwise, you agree to our Privacy Policy

Loading . . .
Quiz
Question:

Answer:

Quiz Result
Total QuestionsCorrect AnswersWrong AnswersPercentage

Explore 1000+ varieties of Mock tests View more