1.存在O(1n),O(n−2),O(1nm)O(\frac{1}{n}),O(n^{-2}),O(\frac{1}{n^m})O(n1),O(n−2),O(nm1)之类的玄学时间复杂度吗?精心构造呢?空间复杂度呢?
2.猴子排序是 O(1)O(1)O(1)还是O(n×n!)O(n\times n!)O(n×n!)啊?