அல்கோரிதம்divide into smaller parts
Smaller subproblems
TT
Testlaa Team
May 14, 2026•1 min read
Independent subproblems / invariant.
Try this in Python
def max_in(a):
return max(a) if len(a) <= 2 else max(max_in(a[: len(a) // 2]), max_in(a[len(a) // 2 :]))
print(max_in([3, 1, 4, 1, 5]))
Key takeaways
- Merge correctness proof.
- Value vs index split.
- Python stack limits.
Tags:
Divide and conquerPythonமாணவர்கள்
