Big-O表示法O(n)和Little-O表示法有o(n)什么区别？
O(n)
o(n)
algorithm big-o time-complexity asymptotic-complexity little-o
algorithm ×1
asymptotic-complexity ×1
big-o ×1
little-o ×1
time-complexity ×1