# Problem
This loop runs until an even number is found. What is the time complexity?
```python
def find_even(arr):
    for i in arr:
        if i % 2 == 0:
            return i
```

# Solution

We're only interested in the upper bound. We can expect the following runtime if the loop never finds an even number:
| Input Size | Steps  |
| --- | --- |
| 1 | 1 |
| 2 | 2 |
| 3 | 3 |
| 4 | 4 |
| 5 | 5 |

### How does the runtime increase w.r.t. input size?

The number of steps is determined by the size of the array $N$.

### What is the time complexity?

$O(N)$: the runtime increases linearly with the input size.

-----
##### 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