递归法实现猴子吃桃，第十天一个桃子，球第一天的数量，每天吃的数量是前一天数量的一半加一，递归法整数排序-Recursive method to achieve the monkeys eat peaches, the tenth day of a peach, the number of the first day of the ball, eat the day before the number is half the number plus one, sort integer recursion