Questions like

analyze a time complexity of the following recursion T(n) = T(something) + f(n)

these questions receive mixed feedback. Some people eagerly advocate them to be closes/moved to math/cs site and some questions got many reasonable attention. Also these questions do not require programming, the analysis of algorithms is a required topic in almost all CS programs. Many of these problems are posted in recurrence tag.

Recently I wanted to refresh my skills and solved many of these problems. The problem that I saw is that some of the questions are duplicates of each other and many of them are really similar.

My question is: should these types of questions be allowed here? And if they should does it make sense to have a wiki question and when someone post a question about finding a time complexity of the recurrence they will be redirected to a wiki page where a person will see a list of already asked and answered questions like:

**recurrence for a master method**

- T(n) = T(n/2) + 1
- T(n) = 3T(n/4) + log n
- .....

**recurrence that consist of many calls to a sub recurrence function**

- T(n) = T(n/2) + T(n/4) + 1
- T(n) = T(n/2) + T(n/4) + T(n/8) + log n
- ...

**recurrences with a square root**

- T(n) = T(sqrt(n)) + log n
- T(n) = 2T(sqrt(n)) + 1
- ...

**something else**

Do you think this makes sense or is this useless?

`how to solve T(n) = T(n/3) + 1`

a person will try to look and find the similar question T(n) = T(n/2) + 1, look how people solved it and only if he was not able to solve with the hint he would ask a new question.