Range minimum query
≈ 1 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
In computer science, a range minimum query (RMQ) solves the problem of finding the minimal value in a sub-array of an array of comparable objects. Range minimum queries have several use cases in computer science, such as the lowest common ancestor problem and the longest common prefix problem (LCP).
In computer science, a range minimum query (RMQ) solves the problem of finding the minimal value in a sub-array of an array of comparable objects. Range minimum queries have several use cases in computer science, such as the lowest common ancestor problem and the longest common prefix problem (LCP). ==See also== Range query (data structures) ==External links== An article on Range Minimum Queries on TopCoder Range Minimum Query article on PEGWiki / P3G Stanford CS166 RMQ introduction slides
Text derived from https://en.wikipedia.org/w/index.php?oldid=1369245529 under CC BY-SA 4.0; modifications have been made.