Question

 public void printAllPossibleOrderedPairs(int[] arrayOfItems) {
    for (int firstItem : arrayOfItems) {
        for (int secondItem : arrayOfItems) {
            int[] orderedPair = new int[]{firstItem, secondItem};
            System.out.println(Arrays.toString(orderedPair));
        }
    }
}
The method above runs in O(n^2)O(n​2​​) time (or "quadratic time")

True

False

Answer 1

 public void printAllPossibleOrderedPairs(int[] arrayOfItems) {
    for (int firstItem : arrayOfItems) {    // iterates n times
        for (int secondItem : arrayOfItems) {    // iterates n times
            int[] orderedPair = new int[]{firstItem, secondItem};   // takes O(1) time. because it's a trivial operation
            System.out.println(Arrays.toString(orderedPair));   // takes O(1) time. because it's a trivial operation
        }
    }
}

so, total number of operations = n*n = O(n^2)
hence it's a quadratic time function.

Answer: True