Time Complexity is a measure of the time an algorithm takes to run relative to input size. Used in computer science to evaluate algorithm efficiency.
A sorting algorithm has O(n log n) time complexity for n elements.
Thank you for contacting us. We will get back to you shortly.
