A searching algorithm for sorted arrays that checks fewer elements by jumping ahead by fixed steps.
Jump search is a searching algorithm for sorted arrays that works by jumping ahead by fixed steps (typically √n) and then performing a linear search within the block. It provides a balance between the linear search and binary search algorithms, offering better performance than linear search while being simpler to implement than binary search.