Consider the two algorithms: Algorithm A$,$ whose time complexity is O$($n$^2)$ and Algorithm B$,$ whose time complexity is O$($n log n$).$ If both algorithms are applied to a large input data, which algorithm is expected to perform better and why?