令n＝2的m次方，A是一个2n维的数组，待求最大值的数存放在A(n),A(n＋1)，……A(2n-1)中，所求得的最大值置于A(1),于是算法描述如下：



　　输入：n＝2的m次方个数存在数组A(n；2n－1)中；



　　输出：最大数置于A(1)中。

-So that n = m th power of 2, A is a 2n-dimensional array, to be seeking the maximum number stored in A (n), A (n+ 1), ...... A (2n-1), and the obtained maximum values placed on A (1), so the algorithm is described as follows:



Input: n = m 2 to the power of an array is the number of A (n　2n-1)　and



Output: Maximum number of placed A (1) in.