Go up to Top
Go forward to Parallel Solutions

Maximum of a Set of Numbers

Let $A[N ...N-1]$ be an array of integers.
Compute m satisfying
- $m$ = <max $i$ : 0 $<=$ $i < N$ :: $A[i]$ >
First UNITY solution
- $m$ = <max $i$ : 0 $<=$ $i < N$ :: $A[i]$ >
Refined solution for sequential architectures:
- invariant $m$ $<=$ <max $i$ : 0 $<=$ $i < N$ :: $A[i]$ >
- FP $<=>$ $m$ $>=$ <max $i$ : 0 $<=$ $i < N$ :: $A[i]$ >
- FP $<=>$ <and $i$ : 0 $<=$ $i < N$ :: $m$ $>=$ $A[i]$ >
- FP $<=>$ <and $i$ : 0 $<=$ $i < N$ :: $m$ = max( $m$ , $A[i]$ )>
Program Maximum1
initially m = -infinity
assign <[] i: 0 <= i < N :: m := max(m, A[i])>
end {Maximum1}

Wolfgang.Schreiner@risc.uni-linz.ac.at

Id: unity3.tex,v 1.1 1996/04/19 12:29:22 schreine Exp schreine

Next