InsertionSort

# -*- coding: utf-8 -*-
"""
Created on Mon Nov 19 07:55:01 2018

@author: kowamich
"""

A=[]
from random import randint
for i in range(0,100):
    j=randint(1,100)
    A.append(j)
print(A)

def Insert_sort(A):
    for i in range(1,len(A)):
        klucz = A[i]
        j = i - 1
        while j>=0 and A[j]>klucz:
            A[j + 1] = A[j]
            j = j - 1
        A[j + 1] = klucz

Insert_sort(A)
print(A)