2019-02-11 Basic Algorithms Lec5

Talked about the notation.
Some logarithms, e.g.,

Complexities

• worst case
• best case
• average
• space complexity
• IO complexity

function Search(x, A[1,..n])
    for i from 1 to n
        if A[i] = x then return True
    return False

Worst Case

Best Case