Subquadratic Time Algorithm

From GM-RKB
Jump to navigation Jump to search

A Subquadratic Time Algorithm is an algorithm that satisfies the time complexity defined as T(n) = O(n2)



References

2015