Jump search is an improvement over linear search.In jump search, we jump block by block and check if the key element is inside the block.If the key element is inside the block, we do a linear search in that block.The time complexity of jump search is O(sqrt(n)).