4.1-5
FIND-MAXIMUM-SUBARRAY(A, low, high)
tempStart = 0
sum = 0
max = −∞
for i = 0 to A.length-1
sum += A[i]
if sum > max
max = sum
low = tempStart
high = i
if sum < 0
sum = 0
tempStart = i + 1
4.2-5
V. Pan has discovered a way of multiplying 68 x 68 matrices using 132,464
multiplications, a way of multiplying 70 x 70 matrices using 143,640 multiplications,
and a way of multiplying 72 x 72 matrices using 155,424 multiplications. Which
method yields the best asymptotic running time when used in a divide-and-conquer
matrix-multiplication algorithm? How does it compare to Strassen’s algorithm?
Solution:
( ) = 132464 ( ),
( ) =
≅
.
( ) = 143640 ( ),
( ) =
≅
.
( ) = 155424 ( ),
( ) =
≅
.
> >
The fastest one asymptotically is 70 × 70 using 143,640.
.
< .
70 × 70 using 143,640 is better than Strassen’s algorithm.