Greedy algorithm

Sort / traverse — invariant.

Try this in Python

xs = [5, 2, 8]
ans = 0
for x in sorted(xs):
    ans += x
print(ans)

Key takeaways

• Tree greedy patterns.
• Dijkstra greedy.
• Order proof note.