difference between subquadratic and quadratic algorithm [closed]

Question

I am confused between a sub-quadratic and quadratic algorithm. I know quadratic is when the big O is n square. Then what is a sub-quadratic algorithm?

Answer 1

Subquadratic designates an algorithm whose complexity is ~o(n^2), using the little-o notation. This means that the complexity grows much slower than n^2. It could be anything from linear to almost quadratic.