@kaia if you can stomach the math, look at how recurrence relations are solved, quite a few recurrence algorithms can be reduced to a single expression, other wise the general, d&conquer, dynamic programming, branch and bound etc