Algo lab/hints/recursions

This page gives hints on recursive & divide-and-conquer tasks.

Get the templates here.

• uva11057_exactsum: try all first number, use binary search to find the second number

• uva11621_smallfactors: binary search over the set C23

• uva11413_fill: binary search on the solution (the maximum capacity)

• uva12965_angrybids: try the possible bid prices. (What are possible bid prices?)

• uva10742_newrule: find range of possible values of the two coins.