In a nutshell
Jump search works on a sorted list by hopping forward in fixed-size steps — say every √n elements — instead of checking one at a time. The moment a hop lands on a value past the target, it knows the target sits in the block just jumped over, so it walks back through that one block element by element. Bigger leaps mean fewer hops but a longer walk-back; a block size of √n balances the two for O(√n) time.