Script started on Thu Dec 15 17:55:02 1994 conx [emulator] pram -t -c -r 8 max2 1 2 3 4 5 6 7 8 CLOCK: 572 8 conx [emulator] exit exit script done on Thu Dec 15 17:55:18 1994 The above is the result of 8(N) number with 64(N^^2) processors. The following are the result using different number of N: N number and N^^2 processors N=1 ---> 570 cycles N=2 ---> 572 cycles N=4 ---> 572 cycles N=8 ---> 572 cycles N=16 ---> 572 cycles N=32 ---> 572 cycles N=64 ---> 572 cycles In this case, we can easily know that this algorithm can find the maximum number in constant time.