Algorithm (Python)

An algorithm is a concrete and effective procedure for solving a problem.

The complexity of the algorithm, indicating the operating efficiency of the code, denoted by an uppercase o parenthesis, such as O (1), O (n)

It is considered that the complexity of the algorithm is gradual, that is, for an input of size n, if his operation time is N3+5n+9, then his progressive time complexity is N3

First say find:

1. Sequential Lookup

2. Two points Search

def Binary_serach (li,val):     = 0    = Len (li)-1 while low     <= high :        = (low+high)//2        if li[mid ] = = val            :return  mid        elif Li[mid] > val            := Mid-1        Else:            = mid+1    else:        return None

Sort:

Three slow speed:

1. Bubble sort

Algorithm (Python)