编写一个递归算法实现：

T(n)=T[n/2](向上取整)+T[n/2](向下取整)+n T(1)=1

然后用栈来模拟递归调用，重新编写一个算法.

-Write a recursive algorithm implementation:

T (n) = T (rounded up) [n/2]+ T n/2+ n (round down)　T (1) = 1

Then use the stack to simulate the recursive call to write an algorithm.