算法导论：2.1插入排序练习题 python描述

# 2.1插入排序练习题
# 2.1-1
A = [31, 41, 59, 26, 41, 58]
A = [31, 41, 59, 26, 41, 58]
A = [31, 41, 59, 26, 41, 58]
A = [26, 31, 41, 59, 41, 58]
A = [26, 31, 41, 41, 59, 58]
A = [26, 31, 41, 41, 58, 59]

# 2.1-2

A = [99, 38, 65, 97, 76, 13, 27, 49]


def insertsort(A):
    length = len(A)
    for j in range(1, length):
        key = A[j]
        i = j - 1
        while i >= 0 and A[i] < key:
            A[i + 1] = A[i]
            i = i - 1
        A[i + 1] = key


insertsort(A)

print(A)

# 2.1-3

A = [99, 38, 65, 97, 76, 13, 27, 49]


def search(A, value):
    length = len(A)
    for j in range(0, length):
        if A[j] == value:
            return j
        elif j == length - 1:
            return None


print(search(A, 27))

# 2.1 - 4
A = [1, 1, 0, 0, 1, 1, 0, 1]
B = [1, 1, 1, 0, 1, 0, 1, 1]


def sumbinary(A, B):
    A.reverse()
    B.reverse()
    C = []
    temp = 0
    length = len(A)
    for i in range(0, length):
        C.append(A[i] + B[i] + temp)
        if C[i] > 1:
            C[i] %= 2
            temp = 1
        else:
            temp = 0
    C.append(temp)
    C.reverse()
    return C


print(sumbinary(A, B))