Find the most advantageous sequence of currency exchange

Published: 21/10/2019
Find the most advantageous sequence of currency exchange
Source: STACKOVERFLOW.COM

I am working with the following exercise from my book: Shortest path algorithms can be applied in currency trading. Let c 1 , c 2 , . . . , c n be various currencies; for instance, c 1 might be dollars, c 2 pounds, and c 3 lire. For any two currencies c i and c j , there is an exchange rate r i,j ; this means that you can purchase r i,j units of currency c j in exchange for one unit of c i . These

Read more
Related news
Comment
FACEBOOK