Time Complexity

Question 1

What is the time complexity of this function?

public static void printFirstItem(int[] items) {
System.out.println(items[0]);
}

Answer 1

This method runs in O(1)O(1) time (or “constant time”) relative to its input.

Question 2

void printAllItems(const vector& items)
{
    for (int item : items) {
        cout << item << endl;
    }
}

Answer 2

This function runs in O(n) time (or “linear time”), where “n” is the number of items in the vector.

Question 3

void printAllPossibleOrderedPairs(const vector& items)
{
    for (int firstItem : items) {
        for (int secondItem : items) {
            cout << firstItem << ", " << secondItem << endl;
        }
    }
}

Answer 3

this function runs in O(n^2) time (or “quadratic time”).

Question 4

Average and Worst Time Complexity to Access an Array

Answer 4

Average : O(1)

Worst : O(1)