Algorithms

What does Bellman-Ford algorithm refer to?

• A. A sorting algorithm that builds the final sorted array one element at a time by inserting each element into its correct position.
• B. A search algorithm that checks each element in a list sequentially until the target value is found.
• C. An algorithm that computes shortest paths from a single source vertex in a graph, even with negative edge weights. ✓
• D. A method of analyzing algorithms that determines the average time or space cost over a sequence of operations.