June 2018
Intermediate to advanced
316 pages
6h 34m
English
Time complexity measures, or estimates, the time by counting the number of elementary operations. It assumes that performing an elementary operation takes a fixed amount of time. To get a fixed amount of time, you can assume either worst-case complexity or average complexity.
Most commonly, the big O notation is used to express time complexity; for instance, O(1) or O(n):

Let's look at the time complexity of the collections from the JDK.
Read now
Unlock full access