In computer science, an m-by-n array of real numbers is a Monge array if for all i, j, k, l such that:
- and
This array is a Monge array:
17 + 7 = 24
23 + 11 = 34
It holds that the sum of the upper-left and lower right elements is less than or equal to the sum of the lower-left and upper-right elements.
Monge arrays are useful for keeping growth of functions in O(nlog n) time or less.
See also:
- quasi-convex