Resolve "Give T(n) and determine big-Oh: 1 simple recursions"
A simple recursion to analyse. The idea is taken from the CSE edition, but the students have to derive the recurrence equation themselves instead. Closes #85 (closed)
Edited by Yana Angelova