buble sort, selection sort and insertion sort

sortingBasic.py

## Basic Sorting Algorithms

def bubleSort(lst):
    n = len(lst)
    for i in range(n-1):
        for j in range(n-1-i):
            if lst[j]>lst[j+1]:
                tmp = lst[j+1]
                lst[j+1] = lst[j]
                lst[j] = tmp

def bubleSort1(lst):
    n = len(lst)
    for i in range(n-1):
        for j in range(n-1, i, -1):
            if lst[j] < lst[j-1]:
                tmp = lst[j-1]
                lst[j-1] = lst[j]
                lst[j] = tmp

def selectionSort(lst):
    n = len(lst)
    for i in range(n-1):
        minIndex = i
        for j in range(i, n):
            if lst[j] < lst[minIndex]:
                minIndex = j

        if minIndex != i:
            tmp = lst[i]
            lst[i] = lst[minIndex]
            lst[minIndex] = tmp

def insertitionSort(lst):
    for i in range(1, len(lst)):
        tmp = lst[i]
        j = i - 1
        while j>=0 and lst[j]>tmp:
            lst[j+1] = lst[j]
            j-=1
        lst[j+1] = tmp
            

##testing
lst = [6,7,3,1,9,2,4,5,8,0]

#bubleSort(lst)
#bubleSort1(lst)
#selectionSort(lst)
insertitionSort(lst)
print(lst)