Unformatted text preview: P [ i ] = max j P j [ i-1] where P j [ i-1] denotes modiFcation of P [ i-1] where transition from j th currency to next currency X is replaced by transition from j to i to X . Everycomputationof P [ i ]takes O ( n ) time, henceoverall complexity is O ( n 2 ). 1...
View Full Document
- Fall '08
- Algorithms, Trigraph, Computational complexity theory