CPE349 lab 42
I.
Brute Force:
int maxSoFar = 0;
for low = 1 to N
for high = low to N
int ThisSum = 0;
for k = low to high
ThisSum = ThisSum + A[ k ];
if( ThisSum > MaxSum )
maxSoFar = ThisSum;
return maxSoFar;
A. Derive the asymptotic computational comp
CPE 349
Kearns
Problem Set: Maximum Flows
Hand in on 8 1/2 x 11 sheets of paper.
Problem 1: Show the final version of the flow graph that includes the network flow cfw_xi,j s and the labels on
the vertices that were obtained in the final iteration of the
Cpe349 lab 51
Triathalon

Swim, bike, run, is the order (cannot be changed).
Si: ith contestants swim time; Bi: ith contestants bike time; Ri: ith contestants run time;
1. Sort the contestants in decreasing or increasing (Circle correct ordering) order