The Community for Technology Leaders
Green Image
Issue No. 07 - July (1986 vol. 35)
ISSN: 0018-9340
pp: 651-653
V. Konard , Hewlett-Packard
Computing max{a<inf>1</inf>+ b<inf>1</inf>, a<inf>2</inf>+ b<inf>2</inf>, ... ,a<inf>n</inf>+ b<inf>n</inf>} trivially takes n additions. We show that if we are given the ranking for the a's and the b's separately, then an algorithm exists which will compute the maximum in ?2n additions on the average. This can be generalized to yield an efficient algorithm to compute max{h(a<inf>1</inf>,b<inf>1</
ranking, Analysis of algorithms, average complexity, computational geometry, maximum norm, pattern classification

V. Konard, "Efficient Computation of the Maximum of the Sum of Two Sequences and Applications," in IEEE Transactions on Computers, vol. 35, no. , pp. 651-653, 1986.
91 ms
(Ver 3.3 (11022016))