Jump Search Algorithm

The algorithm can be modify by performing multiple levels of jump search on the sublists, before finally performing the linear search. The advantage over the latter is that a jump search only needs to jump backwards once, while a binary can jump backwards up to log N times.

Jump Search source code, pseudocode and analysis