Binary Search using pthread
Last Updated :
27 Dec, 2023
Binary search is a popular method of searching in a sorted array or list. It simply divides the list into two halves and discards the half which has zero probability of having the key. On dividing, we check the midpoint for the key and use the lower half if the key is less than the midpoint and the upper half if the key is greater than the midpoint. Binary search has a time complexity of O(log(n)). Binary search can also be implemented using multi-threading where we utilize the cores of the processor by providing each thread a portion of the list to search for the key. The number of threads depends upon the number of cores your processor has and it's better to create one thread for each core. Examples:
Input : list = 1, 5, 7, 10, 12, 14, 15, 18, 20, 22, 25, 27, 30, 64, 110, 220
key = 7
Output : 7 found in listInput : list = 1, 5, 7, 10, 12, 14, 15, 18, 20, 22, 25, 27, 30, 64, 110, 220
key = 111
Output : 111 not found in list
Note - It is advised to execute the program in Linux based system. Compile in Linux using the following code:
g++ -pthread program_name.cpp
CPP
// CPP Program to perform binary search using pthreads
#include <iostream>
using namespace std;
// size of array
#define MAX 16
// maximum number of threads
#define MAX_THREAD 4
// array to be searched
int a[] = { 1, 5, 7, 10, 12, 14, 15, 18,
20, 22, 25, 27, 30, 64, 110, 220 };
// key that needs to be searched
int key = 110;
bool found = false;
int part = 0;
void* binary_search(void* arg)
{
// Each thread checks 1/4 of the array for the key
int thread_part = part++;
int mid;
int low = thread_part * (MAX / 4);
int high = (thread_part + 1) * (MAX / 4);
// search for the key until low < high
// or key is found in any portion of array
while (low < high && !found) {
// normal iterative binary search algorithm
mid = (high - low) / 2 + low;
if (a[mid] == key) {
found = true;
break;
}
else if (a[mid] > key)
high = mid - 1;
else
low = mid + 1;
}
}
// Driver Code
int main()
{
pthread_t threads[MAX_THREAD];
for (int i = 0; i < MAX_THREAD; i++)
pthread_create(&threads[i], NULL, binary_search,
(void*)NULL);
for (int i = 0; i < MAX_THREAD; i++)
pthread_join(threads[i], NULL);
// key found in array
if (found)
cout << key << " found in array" << endl;
// key not found in array
else
cout << key << " not found in array" << endl;
return 0;
}
import java.util.concurrent.atomic.AtomicInteger;
public class Program {
// Size of array
static final int MAX = 16;
// Maximum number of threads
static final int MAX_THREAD = 4;
// Initial array
static int[] arr = { 1, 5, 7, 10, 12, 14, 15, 18,
20, 22, 25, 27, 30, 64, 110, 220 };
// Key that needs to be searched
static int key = 110;
static boolean found = false;
static AtomicInteger part = new AtomicInteger(0);
// Function to perform Binary Search
static void binarySearch()
{
int thread_part = part.getAndIncrement();
// Each thread checks 1/4 of the array for the key
int low = thread_part * (MAX / 4);
int high = (thread_part + 1) * (MAX / 4);
while (low < high && !found) {
// Normal iterative binary search algorithm
int mid = low + (high - low) / 2;
if (arr[mid] == key) {
found = true;
break;
}
else if (arr[mid] > key) {
high = mid - 1;
}
else {
low = mid + 1;
}
}
}
// Driver Code
public static void main(String[] args)
{
Thread[] thread = new Thread[MAX_THREAD];
for (int i = 0; i < MAX_THREAD; i++) {
thread[i]
= new Thread(new Runnable() {
public void run() {
binarySearch();
}
});
thread[i].start();
}
for (int i = 0; i < MAX_THREAD; i++) {
try {
thread[i].join();
}
catch (InterruptedException e) {
e.printStackTrace();
}
}
if (found) {
System.out.printf("%d found in array\n", key);
}
else {
System.out.printf("%d not found in array\n",key);
}
}
}
// This code is contributed by shivhack999
# Python3 Program to find sum of array
# using multi-threading
from threading import Thread
# Size of array
MAX = 16
# Maximum number of threads
MAX_THREAD = 4
# Initial array
arr = [1, 5, 7, 10, 12, 14, 15, 18,
20, 22, 25, 27, 30, 64, 110, 220]
# Key that needs to be searched
key = 110
found = False
part = 0
# Function to perform Binary Search
def binary_search():
global part, found
thread_part = part
part += 1
# Each thread checks 1/4 of the array for the key
low = int(thread_part*(MAX/4))
high = int((thread_part+1)*(MAX/4))
# search for the key until low < high
# or key is found in any portion of array
while (low < high and not found):
# normal iterative binary search algorithm
mid = int(low + (high-low)/2)
if arr[mid] == key:
found = True
break
elif arr[mid] > key:
high = mid - 1
else:
low = mid + 1
# Driver Code
if __name__ == "__main__":
# Creating list of size MAX_THREAD
thread = list(range(MAX_THREAD))
# Creating MAX_THEAD number of threads
for i in range(MAX_THREAD):
thread[i] = Thread(target=binary_search)
thread[i].start()
# Waiting for all threads to finish
for i in range(MAX_THREAD):
thread[i].join()
# Key found in array
if found:
print("%d found in array" % key)
else:
print("%d not found in array" % key)
using System;
using System.Threading;
public class Program {
// Size of array
const int MAX = 16;
// Maximum number of threads
const int MAX_THREAD = 4;
// Initial array
static int[] arr = { 1, 5, 7, 10, 12, 14, 15, 18,
20, 22, 25, 27, 30, 64, 110, 220 };
// Key that needs to be searched
static int key = 110;
static bool found = false;
static int part = 0;
// Function to perform Binary Search
static void BinarySearch()
{
int thread_part
= Interlocked.Increment(ref part) - 1;
// Each thread checks 1/4 of the array for the key
int low = thread_part * (MAX / 4);
int high = (thread_part + 1) * (MAX / 4);
// Search for the key until low < high
// or key is found in any portion of array
while (low < high && !found) {
// Normal iterative binary search algorithm
int mid = low + (high - low) / 2;
if (arr[mid] == key) {
found = true;
break;
}
else if (arr[mid] > key) {
high = mid - 1;
}
else {
low = mid + 1;
}
}
}
// Driver Code
static void Main()
{
// Creating array of size MAX_THREAD
Thread[] thread = new Thread[MAX_THREAD];
// Creating MAX_THREAD number of threads
for (int i = 0; i < MAX_THREAD; i++) {
thread[i]
= new Thread(new ThreadStart(BinarySearch));
thread[i].Start();
}
// Waiting for all threads to finish
for (int i = 0; i < MAX_THREAD; i++) {
thread[i].Join();
}
// Key found in array
if (found) {
Console.WriteLine("{0} found in array", key);
}
else {
Console.WriteLine("{0} not found in array",
key);
}
}
}
// This code is contributed by shiv1o43g
// Size of array
const MAX = 16;
// Maximum number of threads
const MAX_THREAD = 4;
// Initial array
const arr = [1, 5, 7, 10, 12, 14, 15, 18,
20, 22, 25, 27, 30, 64, 110, 220];
// Key that needs to be searched
const key = 110;
let found = false;
let part = 0;
// Function to perform Binary Search
function binarySearch() {
const threadPart = part;
part += 1;
// Each thread checks 1/4 of the array for the key
let low = Math.floor(threadPart * (MAX / 4));
let high = Math.floor((threadPart + 1) * (MAX / 4));
// Search for the key until low < high
// or key is found in any portion of the array
while (low < high && !found) {
// Normal iterative binary search algorithm
const mid = Math.floor(low + (high - low) / 2);
if (arr[mid] === key) {
found = true;
break;
} else if (arr[mid] > key) {
high = mid - 1;
} else {
low = mid + 1;
}
}
}
// Driver Code
// Creating MAX_THREAD number of threads
const threads = new Array(MAX_THREAD).fill(null).map(() => {
return new Promise(resolve => {
binarySearch();
resolve();
});
});
// Waiting for all threads to finish
Promise.all(threads).then(() => {
// Key found in array
if (found) {
console.log(`${key} found in array`);
} else {
console.log(`${key} not found in array`);
}
});
Time complexity: O(log(n))
Space complexity: O(1)
Similar Reads
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
What is Binary Search Algorithm? Binary Search is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half and the correct interval to find is decided based on the searched value and the mid value of the interval. Example of binary searchProperties of Binary Search:Binary search is performed o
1 min read
Time and Space Complexity Analysis of Binary Search Algorithm Time complexity of Binary Search is O(log n), where n is the number of elements in the array. It divides the array in half at each step. Space complexity is O(1) as it uses a constant amount of extra space. Example of Binary Search AlgorithmAspectComplexityTime ComplexityO(log n)Space ComplexityO(1)
3 min read
How to calculate "mid" or Middle Element Index in Binary Search? The most common method to calculate mid or middle element index in Binary Search Algorithm is to find the middle of the highest index and lowest index of the searchable space, using the formula mid = low + \frac{(high - low)}{2} Finding the middle index "mid" in Binary Search AlgorithmIs this method
6 min read
Variants of Binary Search
Variants of Binary SearchBinary search is very easy right? Well, binary search can become complex when element duplication occurs in the sorted list of values. It's not always the "contains or not" we search using Binary Search, but there are 5 variants such as below:1) Contains (True or False)Â 2) Index of first occurrence
15+ min read
Meta Binary Search | One-Sided Binary SearchMeta binary search (also called one-sided binary search by Steven Skiena in The Algorithm Design Manual on page 134) is a modified form of binary search that incrementally constructs the index of the target value in the array. Like normal binary search, meta binary search takes O(log n) time. Meta B
9 min read
The Ubiquitous Binary Search | Set 1We are aware of the binary search algorithm. Binary search is the easiest algorithm to get right. I present some interesting problems that I collected on binary search. There were some requests on binary search. I request you to honor the code, "I sincerely attempt to solve the problem and ensure th
15+ min read
Uniform Binary SearchUniform Binary Search is an optimization of Binary Search algorithm when many searches are made on same array or many arrays of same size. In normal binary search, we do arithmetic operations to find the mid points. Here we precompute mid points and fills them in lookup table. The array look-up gene
7 min read
Randomized Binary Search AlgorithmWe are given a sorted array A[] of n elements. We need to find if x is present in A or not.In binary search we always used middle element, here we will randomly pick one element in given range.In Binary Search we had middle = (start + end)/2 In Randomized binary search we do following Generate a ran
13 min read
Abstraction of Binary SearchWhat is the binary search algorithm? Binary Search Algorithm is used to find a certain value of x for which a certain defined function f(x) needs to be maximized or minimized. It is frequently used to search an element in a sorted sequence by repeatedly dividing the search interval into halves. Begi
7 min read
N-Base modified Binary Search algorithmN-Base modified Binary Search is an algorithm based on number bases that can be used to find an element in a sorted array arr[]. This algorithm is an extension of Bitwise binary search and has a similar running time. Examples: Input: arr[] = {1, 4, 5, 8, 11, 15, 21, 45, 70, 100}, target = 45Output:
10 min read
Implementation of Binary Search in different languages
C Program for Binary SearchIn this article, we will understand the binary search algorithm and how to implement binary search programs in C. We will see both iterative and recursive approaches and how binary search can reduce the time complexity of the search operation as compared to linear search.Table of ContentWhat is Bina
7 min read
C++ Program For Binary SearchBinary Search is a popular searching algorithm which is used for finding the position of any given element in a sorted array. It is a type of interval searching algorithm that keep dividing the number of elements to be search into half by considering only the part of the array where there is the pro
5 min read
C Program for Binary SearchIn this article, we will understand the binary search algorithm and how to implement binary search programs in C. We will see both iterative and recursive approaches and how binary search can reduce the time complexity of the search operation as compared to linear search.Table of ContentWhat is Bina
7 min read
Binary Search functions in C++ STL (binary_search, lower_bound and upper_bound)In C++, STL provide various functions like std::binary_search(), std::lower_bound(), and std::upper_bound() which uses the the binary search algorithm for different purposes. These function will only work on the sorted data.There are the 3 binary search function in C++ STL:Table of Contentbinary_sea
3 min read
Binary Search in JavaBinary search is a highly efficient searching algorithm used when the input is sorted. It works by repeatedly dividing the search range in half, reducing the number of comparisons needed compared to a linear search. Here, we are focusing on finding the middle element that acts as a reference frame t
6 min read
Binary Search (Recursive and Iterative) - PythonBinary 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). Below is the step-by-step algorithm for Binary Search:D
6 min read
Binary Search In JavaScriptBinary Search is a searching technique that works on the Divide and Conquer approach. It is used to search for any element in a sorted array. Compared with linear, binary search is much faster with a Time Complexity of O(logN), whereas linear search works in O(N) time complexityExamples: Input : arr
3 min read
Binary Search using pthreadBinary search is a popular method of searching in a sorted array or list. It simply divides the list into two halves and discards the half which has zero probability of having the key. On dividing, we check the midpoint for the key and use the lower half if the key is less than the midpoint and the
8 min read
Comparison with other Searching
Binary Search Intuition and Predicate Functions The binary search algorithm is used in many coding problems, and it is usually not very obvious at first sight. However, there is certainly an intuition and specific conditions that may hint at using binary search. In this article, we try to develop an intuition for binary search. Introduction to Bi
12 min read
Can Binary Search be applied in an Unsorted Array? Binary Search is a search algorithm that is specifically designed for searching in sorted data structures. This searching algorithm is much more efficient than Linear Search as they repeatedly target the center of the search structure and divide the search space in half. It has logarithmic time comp
9 min read
Find a String in given Array of Strings using Binary Search Given a sorted array of Strings arr and a string x, The task is to find the index of x in the array using the Binary Search algorithm. If x is not present, return -1.Examples:Input: arr[] = {"contribute", "geeks", "ide", "practice"}, x = "ide"Output: 2Explanation: The String x is present at index 2.
6 min read