# Problem

This function prints the diagonal elements in a 2D array. What is the time complexity?

```python
def print_diagonal_elements(matrix):
    for i in range(len(matrix)):
        for j in range(len(matrix[i])):
            if i == j:
                print(matrix[i][j])
```


# Solution


The outer loop takes $O(N)$ time and the inner loop takes $O(C)$ time, where $C$ is the number of columns. We wish to only consider the worst case where the number of columns equals the number of rows. The resulting time complexity will be $O(N^2)$.

-----
##### This workbook was created by Jad and Rayan Slim. Feel free to explore some of their courses:
##### [The Complete Java Development Bootcamp](https://udemy-redirect-app.herokuapp.com/java)
##### [The Complete Spring Boot Development Bootcamp – Become a Java Web Developer](https://udemy-redirect-app.herokuapp.com/spring)


Problem 10 Solution

Problem 12 Solution

Problem 4 Solution

Problem 8 Solution

Workbook

Problem 7 Solution

Problem 15 Solution

Problem 2 Solution

Problem 14 Solution

Problem 6 Solution

Problem 5 Solution

Problem 17 Solution

Problem 3 Solution

Problem 1 Solution

Problem 16 Solution

Problem 13 Solution

Problem 11 Solution

Problem 9 Solution

Big O