Jump Search - Basic Algorithms Fast (17)

Let's learn jump search process. We jump through the array using the optimal jump size until the interval that possibly contains the target is found. Then we reduce the jump size to one, and jump until the target is found, or until an element in concern is larger than the target.

0:44 - Find the optimal jump size
2:45 - Case when the target is found
5:41 - Case when the target is not found

Playlist of my Algorithm walkthrough

Basic Python Fast

Playlist of my Python examples

Playlist of my Java course

Playlist of my Java examples

#jumpsearch #algorithm #begincodingfast #algorithmvisualization