Skip to content
Skein

exchange argument

RU: аргумент обмена

A proof technique for greedy algorithms: take any optimal solution and show you can swap its first choice for the greedy one without making it worse. This shows the greedy first choice is safe.

shortcutsexpand
search
⌘K
prev piece
k
next piece
j
cycle tier
t
this menu
?