4 ms·
The recursion assumes that log(n) > w; if log(n) <= w, then you're in the base case and it's O(n).
by karpierz 6y ago
The recursion assumes that log(n) > w; if log(n) <= w, then you're in the base case and it's O(n).
- deleted 6y ago[deleted]
loading thread…