No.13561266 ViewReplyOriginalReport
How does /sci/ deal with floor and ceils in solving recurrence relations via substitution. In the book Introduction to Algorithms by CLRS they say that the floor and ceils are "Usually ignored" and they are in the solutions in the book.

However I do see some adding a +1 to the ceil term(that is if we have ceil(n/2) it becomes (n/2+1) in the induction.

What are the consequences of factoring in floors and ceils or simply ignoring them?