The time factor when determining the efficiency of an algorithm is measured by
Explanation
Time Complexity Function
Agar n input size hai aur T(n) total time hai, toh:
Yahan f(n) algorithm ke steps ki sankhya ko darshata hai.
Big O Notation
Efficiency ko measure karne ke liye hum aksar Big O Notation ka use karte hain, jo "Worst-case Scenario" batata hai:
Yahan g(n) growth rate hai. Example ke liye:
Short Answer: Time factor ko Number of elementary operations