### Instruction: What is the time complexity of the following algorithm?

```python
def find_max(lst):
    max_num = lst[0]
    for num in lst:
        if num > max_num:
            max_num = num
    return max_num
```
Express your answer using big O notation.### Response: The time complexity of the given algorithm is O(n), where n is the length of the input list `lst`. This is because the algorithm iterates through the list once, comparing each element to the current maximum value.