You need to implement a certain algorithm for an array of size n$.$ You find some open source code on the internet which claims to do exactly what you need, but

before using it$,$ you decide to analyze its efficiency. You have counted up the operations and determined that it needs $2n^2+logn$ operations.

True$/$False: you will typically have arrays with large $n.$ This algorithm is a better choice than another algorithm which is log $n.$

True

False