复杂度

时间复杂度

some problems time complexity is less than input size, which is hard for me.
find the median of two sorted arrays. in log(n+m) time
https://leetcode.com/problems/median-of-two-sorted-arrays/
In fact, many differences in time complexity theory can not be distinguished by programs.

  1. 复杂度
    1. 时间复杂度