Time Complexity

Contribution by Raouf Ould Ali.

One of the most important aspects of writing efficient code is understanding the time complexity of algorithms. Time complexity is a way to express how the runtime of an algorithm grows relative to the input size. It helps analyze and compare the efficiency of different algorithms.

Here are some useful resources to understand time complexity:

Documents and Articles

• The Incarnadine Training Units - Time Complexity (en)
• Competitive Programming Handbook - Chapter 2 (en)
• A Time Complexity Guide (en)

Videos

• Learn Big O notation in 6 minutes - Bro Code (en)
• Big-O Notation in 5 minutes (en)
• Intro to Time Complexity for CP (en)
• شرح مفهوم الـ Big O - Notation (ar)
• Time Complexity Analysis (ar)