Why can't we use binary search in jump search instead of linear search?

Question

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?

Answer 1

The use case for jump search (O(√n)) over binary search (O(log n)) is when jumping back is expensive. Replacing the linear search in jump search would be counterproductive in that regard.