Computing Minima and Maxima of Subarrays

Ingo Wald · Apress eBooks · 2019

This chapter explores the following problem: given an array A of N numbers Ai, how can we efficiently query the minimal or maximal numbers in any sub-range of the array? For example, “what is the minimum of the 8th to the 23rd elements?”

Read the paper · More papers on PaperTik