判断题：Given two algorithms A1 and A2, with time complexities being

Given two algorithms $$A_1$$ and $$A_2$$, with time complexities being $$T_1 = O(n^2)$$ and $$T_2 = O(n\log n)$$, respectively. Then $$A_2$$ must be faster than $$A_1$$.

答案：FALSE