2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/100629In this paper we investigate the problem of searching monotone multi-dimensional arrays. We generalize Linial and Saks' search algorithm \cite{LS1} for monotone 3-dimensional arrays to $d$-dimensions with $d\geq 4$. Our new search algorithm is asymptotically optimal for $d=4$.13 pages, 2 figures; same results, presentation improved, add two figuresData Structures and AlgorithmsDiscrete MathematicsF.2.2; G.2.1text