You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Created a persistent binary search tree (PBST) and persistent stack. When adding a new element will create a new stack or PBST with the new element and connect the new PBST or stack to the previous PBST or stack. ***Please see README***
Receives file as list of cities and distance between these cities. Creates an Adjacency List, graph, then creates a Binomial Queue and uses Dijkstra's Algorithm to continually remove shortest distance between cities. SEE README
Simulated GBM using MC simulation, estimated option' Greeks using numerical methods such as finite difference, pathwise derivative estimate and likelihood ratio methods. Lastly, implemented binomial tree option pricing to price American option.