Codebountiful

Binary search  is the most popular Search algorithm. It is efficient and also one of the most commonly used techniques that are used to solve problems. If all the names in the world are written down together in order and you want to search for the position of a specific name, binary search will accomplish this in a maximum of  35  iterations. Binary search works only on a sorted set of elements. To use binary search on a collection, the collection must first be sorted. When the binary search is used to perform operations on a sorted set, the number of iterations can always be reduced on the basis of the value that is being searched. Let us consider the following array: By using a linear search, the position of element 8 will be determined in the  9 t h  iteration. Let's see how the number of iterations can be reduced by using a binary search. Before we start the search, we need to know the start and end of the range. Let's call them...

Linear search is used on a collection of items. It relies on the technique of traversing a list from start to end by exploring properties of all the elements that are found on the way. For example, consider an array of integers of size  N . You should find and print the position of all the elements with value  x . Here, the linear search is based on the idea of matching each element from the beginning of the list to the end of the list with the integer  x , and then printing the position of the element if the condition is `True'. Implementation: for ( start to end of array ) { if ( current_element equals to 5 ) { print ( current_index ); } }