It is well-known that one can sort (order)n real numbers in at most F0(n) =nl - 2l + 1 steps (comparisons), where l = [log2n]. We snow how to find the strict saddlepoint or prove its absence in an m by n matrix, m ≤n, in at most F0(m)+F0(m+1)+n+m - 3 + (n-m) [log2(m+1)] steps.
All Science Journal Classification (ASJC) codes
- Statistics and Probability
- Mathematics (miscellaneous)
- Social Sciences (miscellaneous)
- Economics and Econometrics
- Statistics, Probability and Uncertainty