Programming, Algorithms, Data Structures, Coding Interviews, Data.
quickly by a factor of some constant at each recursive call. Due to this, the height of the recursion tree will be O(log n). The best examples are merge sort and binary search, where the input size decreases by a factor of 1/2 (e.g. n -> n/2 -> n/4 and so on). In dynamic programming, the input size