# Problem
This function takes an array and a number, and returns a new array that contains all elements of the input array that are divisible by the given number.

```python
def filter_by_divisibility(arr, divisor):
    new_arr = []
    for i in range(len(arr)):
        if arr[i] % divisor == 0:
            new_arr.append(arr[i])
    return new_arr
```
# Solution

You may apply the three-step process, but it's evident that the number of loops is determined by the size of the array. The operations inside the loop are constant-time. It follows that the time complexity is $O(N)$.

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