The following article explains Jump Search:
http://www.geeksforgeeks.org/jump-search/
The last step is a linear search. Why can't we use binary search if the array is already sorted and time complexity of binary search is log(n) while of the linear search it is n?