Find the computational complexity of the given program
You can analyze using master theorem:
$$T(n) = T(\lfloor\frac{n}{2}\rfloor) + T(\lceil\frac{n}{2}\rceil) + 1$$

As we can suppose $n = 2^k$ and there is no a difference in the asymptotic complexity, We can say $T(n) = 2T(\frac{n}{2})+ 1$.

Hence, from master theorem we can say $T(n) = \Theta(n)$.