Found in
finance
Articles
GRA
Algorithm
The Bellman–Ford algorithm
Shortest paths with negative edges and finding a negative cycle: V rounds over all edges.
O(V · E)
2 problems
NUM~
Algorithm
Bisection and Newton's method
A root of an equation: halving an interval is reliable, Newton's tangents are fast.
bisection: log₂((b − a)/ε) steps; Newton: about log₂ of the number of digits
2 problems
Problems
Often together
numerical precision 2 classic 2 interviews 2 shortest path 1 weighted graph 1 graph 1 dynamic programming 1 networks 1 root finding 1 binary search 1 iterative 1 approximation 1