data structures using high mid else low mid return - int main(int arr[max]invalposclrscr()printf("\ enter the number of elements in the array ")scanf("% "& )printf("\ enter the elements ")for( <ni++scanf("% "&arr[ ])printf("\ enter the value to be searched ")scanf("% "&val)pos interpolation_search(arr - val)if(pos =- printf("\ % is not found in the array"val)else printf("\ % is found at position % "valpos)getche()return jump search when we have an already sorted listthen the other efficient algorithm to search for value is jump search or block search in jump searchit is not necessary to scan all the elements in the list to find the desired value we just check an element and if it is less than the desired valuethen some of the elements following it are skipped by jumping ahead after moving little forward againthe element is checked if the checked element is greater than the desired valuethen we have boundary and we are sure that the desired value lies between the previously checked element and the currently checked element howeverif the checked element is less than the value being searched forthen we again make small jump and repeat the process once the boundary of the value is determineda linear search is done to find the value and its position in the array for exampleconsider an array [{ , , , , , , , , the length of the array is if we have to find value then following steps are performed using the jump search technique step first three elements are checked since is smaller than we will have to make jump ahead step next three elements are checked since is smaller than we will have to make jump ahead step next three elements are checked since is greater than the desired value lies within the current boundary step linear search is now done to find the value in the array the algorithm for jump search is given in fig