What are some examples of time complexity in C++?

Can you explain time complexity with examples in C++?

Sure! Time complexity measures how the runtime of an algorithm increases with the size of the input. For example, a simple loop that iterates through an array has a time complexity of O(n).

What about nested loops?

Good question! A nested loop, where one loop runs inside another, typically has a time complexity of O(n^2). For instance, if you have two loops iterating over the same array, the total operations would be n * n.

Can you give me a code example for O(n^2)?

Certainly! Here's a simple example:

for(int i = 0; i < n; i++) {
    for(int j = 0; j < n; j++) {
        // Some operation
    }
}

What about O(log n) time complexity?

O(log n) time complexity is often seen in algorithms that divide the problem in half each time, like binary search. For example, in a sorted array, you can find an element by repeatedly dividing the search interval in half.