Sorting Algorithms

Bubble sort

def bubble_sort(arr):
    for i in range(0, len(arr)):
        for j in range(0,len(arr)-i-1):
            if arr[j] > arr[j+1]:
                arr[j+1],arr[j] = arr[j], arr[j+1]

bubble_sort([6,5,4,3,1,2])
bubble_sort([80,90,30,50])

Selection sort

def selection_sort(arr):
    for i in range(len(arr)-1,0,-1):
    PositionMax = 0
        for location in range(0, i+1):
            if arr[location] > arr[PositionMax]:
                PositionMax = location
        arr[i],arr[PositionMax]=arr[PositionMax],arr[i]

selection_sort([6,5,4,3,1,2])
selection_sort([80,90,30,50])

Insertion Sort

def insertion_sort(arr):
    for i in range(1,len(arr)):
        current_value = arr[i]
        position = i
        while position>0 and arr[position-1]>current_value:
            arr[position]=arr[position-1]
            position = position-1
        arr[position]=current_value