• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

UGC-NET | UGC NET CS 2015 Dec – III | Question 21

what is the name of the below searching Algorithm?

int function(vector<int> arr,int x){
	int n = arr.size();
	if(n == 0)
		return -1;

	// Find range for binary search by repeatedly doubling i
	int i = 1;
	while(i < n and arr[i] < x)
		i *= 2;

	// Perform binary search on the range [i/2, min(i, n-1)]
	int left = i /2;
	int right = min(i, n-1);

	while(left <= right){
		int mid = (left + right)/2;
		if(arr[mid] == x) return mid;
		else if(arr[mid] < x) left = mid + 1;
		else right = mid - 1;

	return -1;


Linear Search


Sequential Search


Jump  Search


Exponential Search


Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments