This preview shows page 1. Sign up to view the full content.
Unformatted text preview: P [ i ] = max j P j [ i1] where P j [ i1] denotes modiFcation of P [ i1] 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
This note was uploaded on 11/30/2011 for the course COT 5405 taught by Professor Ungor during the Fall '08 term at University of Florida.
 Fall '08
 UNGOR
 Algorithms

Click to edit the document details