An optimal algorithm for finding all the jumps of a monotone step-function

DOI10.1016/0196-6774(85)90043-4zbMath0593.68037OpenAlexW2167621764MaRDI QIDQ3723701

Refael Hassin, Nimrod Megiddo

Publication date: 1985

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(85)90043-4

zbMATH Keywords

binary search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) 2-person games (91A05)

Related Items (5)

A generalization of binary search ⋮ Operations research applications of dichotomous search ⋮ An optimal parallel algorithm for digital curve segmentation ⋮ An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search ⋮ Optimal search for rationals

This page was built for publication: An optimal algorithm for finding all the jumps of a monotone step-function