- Category:
- Other systems
- Tags:
-
[Text]
- File Size:
- 1kb
- Update:
- 2015-06-08
- Downloads:
- 0 Times
- Uploaded by:
- 衣谷
Description: 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.
To Search:
File list (Check if you may need any files):
test3.txt
Download