Given a sorted array and a value x, we need to find floor and ceil value of x in the array using improved binary search technique. Floor value is the largest element smaller than equal to x, whereas ceil value is the smallest element greater than equal to x. Improved Binary Search uses less number of comparisons in… Read More »
Given numbers from 1 to 10^10, we need to select that maximum number i from the range such that A*b(i)+C*i does not exceed m. A and C will be given and b(i) means number of bits in the number. Examples: Input : 16 10 150 Output : 8 Explanation: If we take 7 then 16*3+10*7=118,which is less than 150.… Read More »
Find the minimum number ‘N’ such that the sum of ‘N’ natural numbers is greater than or equal to a given number ‘NUM’ using Binary Search. In this problem, we need to find the minimum number ‘N’ such that the sum of the first ‘N’ number is greater than or equal to the user given number ‘NUM’. The… Read More »
In a prison, there are N cells. The positions of the cells are given in an array. The Jailer has to place all the prisoners in the cells in an ordered manner such that minimum distance between any two prisoners is as large as possible. You have to find that distance. Note: The cells are in a straight… Read More »
Given an array arr[] of n positive integers and q queries, in which each query have an integer k. For each query, the task is to output the minimum size of subarray whose binary representation of each elements if concatenated will have at least k number of set bits. If no such array exist, print -1. Examples: Input… Read More »
In this tutorial, you will learn about linear search. Linear search is a very simple and basic search algorithm. It is basically a sequential search algorithm. We have to write a C Program which finds the position of an element in an array using Linear Search Algorithm. Examples : Input : arr[] = {40, 60, 10, 20, 50,… Read More »
