jump_search (alower_boundupper_boundvalnstep [initializeset step sqrt( ) low lower_boundhigh upper_boundpos - step repeat step while step step if val [stepset high step else set low step [end of ifset [end of loopstep set low step repeat step while <high step if [ival pos print pos go to step [end of ifset [end of loopstep if pos - print "value is not present in the array[end of ifstep exit figure algorithm for jump search advantage of jump search over linear search suppose we have sorted list of elements where the elements have values then sequential search will find the value in exactly iterations but with jump searchthe same value can be found in iterations hencejump search performs far better than linear search on sorted list of elements advantage of jump search over binary search no doubtbinary search is very easy to implement and has complexity of (log )but in case of list having very large number of elementsjumping to the middle of the list to make comparisons is not good idea because if the value being searched is at the beginning of the list then one (or even morelarge step(sin the backward direction would have to be taken in such casesjump search performs better as we have to move little backward that too only once hencewhen jumping back is slower than jumping forwardthe jump search algorithm always performs better how to choose the step lengthfor the jump search algorithm to work efficientlywe must define fixed size for the step if the step size is then algorithm is same as linear search nowin order to find an appropriate step sizewe must first try to figure out the relation between the size of the list (nand the size of the step (kusuallyk is calculated as further optimization of jump search till nowwe were dealing with lists having small number of elements but in real-world applicationslists can be very large in such large lists searching the value from the beginning of the list may not be good idea better option is to start the search from the -th element as shown in the figure below