DEV Community

Sharmin Shanta
Sharmin Shanta

Posted on

1

Time Complexity

We encounter frequently the term Time Complexity, while learning the Data Structure and Algorithm. It is the fundamental concept of computer science and refers to insights into How long an algorithm takes to complete given a certain input size.

Time complexity represents the amount of time an algorithm takes to run as a function of the length of the input and provides an upper bound on the running time, helping us understand the worst-case scenario in terms of performance.

Top comments (0)

Postmark Image

Speedy emails, satisfied customers

Are delayed transactional emails costing you user satisfaction? Postmark delivers your emails almost instantly, keeping your customers happy and connected.

Sign up