John came up with an algorithm for some problem that runs in time theta$($n$^2$ log$($n$)),$ and Bill came up

with an algorithm for the same problem that runs in time little$-$oh$($n$^2$ log$($n$)).$ Based on this information,

which one would you choose? Why?