【アルゴリズム】Pythonで挿入ソートを実装しアルゴリズムを理解する

# 初期データ
data = [8, 6, 5, 3, 6, 10, 4]

# 昇順に並べ替え
ascending_data = sorted(data)
print("昇順:", ascending_data)

# 降順に並べ替え
descending_data = sorted(data, reverse=True)
print("降順:", descending_data)

data = [8,6,5,3,6,10,4]
n = len(data) 
print(f"データ数 = {n}")

for i in range(0,n):
    tmp = data[i]
    j = i

    while j > 0 and data[j -1] >tmp:
        data[j] = data[j-1]
        j = j - 1
        data[j] = tmp

print(f"ソート後のデータは{data}")

data = [8,6,5,3,6,10,4]
n = len(data) 
print(f"データ数 = {n}")

for i in range(0,n):
    tmp = data[i]
    j = i

    while j > 0 and data[j -1] >tmp:
        data[j] = data[j-1]
        j = j - 1
        data[j] = tmp

for i in range(0,n):
    tmp = data[i]
    j = i

    while j > 0 and data[j -1] >tmp:
        data[j] = data[j-1]
        j = j - 1
        data[j] = tmp

    while j > 0 and data[j -1] >tmp:
        data[j] = data[j-1]
        j = j - 1
        data[j] = tmp

    while j > 0 and data[j -1] >tmp:
        data[j] = data[j-1]
        j = j - 1
        data[j] = tmp