# Algorithm Analysis

## Big-Oh Notation

$$
f(n) \leq cg(n), \quad for ; n\leq n\_0
$$

It is called as "f(n) is **big-Oh** of g(n)". 

![](https://1943863620-files.gitbook.io/~/files/v0/b/gitbook-legacy-files/o/assets%2F-MZyJM_SVjd9SJ3tuTbA%2F-Me7kUWmpsT04B23HX8e%2F-Me7v4ZuUjroS7tTYOIV%2Fimage.png?alt=media\&token=ce1058e8-56ae-4225-8a3c-b7c6a4e7453e)

For example

* $$8n+5$$ is $$O(n)$$
* $$5n^4+3n^3+2n^2+4n+1$$ is $$O(n^4)$$
* $$a\_0+a\_1n+\cdots+a\_dn^d$$ is $$O(n^d)$$
* $$2n+100logn$$ is $$O(n)$$

```python
def find_max(data):
    # Return the maximum element from a nonempty Python list
    biggest = data[0] # The initial value to beat
    for val in data: # For each value:
        if val > biggest: # if it is greater than the best so far,
            biggest = val # we have found a new best (so far)
    return biggest # When loop ends, biggest is the max
    
```

* initialization: O(1)
* loop: O(n)
* return: O(1)

To sum up, this algorithm has O(n) time complexity.

```python
def prefix_average1(S):
    # Return list such tath, for all j, A[j] equals average of S[0], ..., S[j]
    n = len(S)
    A = [0]*n     # Create new list of n zeros
    for j in range(n):
        total = 0    # begin computing S[0]+...+S[j]
        for i in range(j+1):
            total += S[i]
        A[j] = total / (j+1)    # record the average
    return A
```

The running time of prefix\_average1 is $$O(n^2)$$

```python
def prefix_average2(S):
    n = len(S)
    A = [0]*n
    for j in range(n):
        A[j] = sum(S[0:j])/(j+1)
    return A
```

This big-Oh notation is used widely to characterize running times and space bounds in terms of some parameter n. (prefix\_average2 is also $$O(n^2)$$)

```python
def prefix_average3(S):
    n = len(S)
    A = [0] * n
    total = 0
    for j in range(n):
        total += S[j]
        A[j] = total / (j+1)
    return A
```

The above expression only has $$O(n)$$time complexity.

## Time complexity in Python

* len(data): O(1)
* data\[j]: O(1)

Python's lists are implemented as **array-based sequences.**


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://statduck.gitbook.io/statduck/python-study/algorithm/algorithm-analysis.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.