数据结构与算法Python语言实现《Data Structures & Algorithms in Python》手写课后答案--第四章
第四章递归代码粗糙,望大佬指出方便改进#4.1front为头指针,rear为尾指针defrecursion(li,front,rear):iffront==rearorfront+1==rear:returnmax(li[rear],li[front])returnmax(recursion(li,front,int((front+rear)/2)),recursion(li,int((front