Skip to main content

One doc tagged with "time complexity quasilinear time"

View All Tags

Time Complexity

Time Complexity is a measure of the amount of time an algorithm takes to solve a problem as a function of the size of the input to the problem. It is commonly estimated by counting the number of elementary operations performed by the algorithm, where an elementary operation takes a fixed amount of time to perform.