Suppose algorithm A has time complexity TA$($n$)=\backslash$Theta $($n$)$ and algorithm B has time complexity

TB$($n$)=\backslash$Theta $($n$^2).$ Which algorithm is generally accepted as $$faster$$ and why?