Hmm fun study topic: which major algorithms stay the same when you "invert" their goal, and which don't?

Where invert can mean at the least: switch max/min or gt/lt, but also for find the subset, find what's not in the subset. At the least.