Algorithm: solves the problem by dividing a problem of size n into two subproblems of half the size, recursively solving the subproblems, and combining the solutions in constant time.

What are the running times of this algorithms $($in asymptotic notation$)?$