Subquadratic time
From Free net encyclopedia
An algorithm is said to run in subquadratic time if its running time <math>f(n)</math> is <math>o(n^2)</math> (more on Big O notation)
An algorithm is said to run in subquadratic time if its running time <math>f(n)</math> is <math>o(n^2)</math> (more on Big O notation)
