Skip to main content
1 of 2
Rinkesh P
  • 1.1k
  • 1
  • 6
  • 17

From wikipedia

Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm

It doesn't take into consideration the computing capabilities of the underlying machine. No matter the machine on which it is computed, the number of operations remain the same.

What you are looking after, would more suitably be called as "running time" or "execution time".

Rinkesh P
  • 1.1k
  • 1
  • 6
  • 17