有人可以帮我计算这两个函数的大 O 吗？我想学习如何计算它，但我只是通过讲座示例而苦苦挣扎

Question

def function1(x):
    while x > 1:
        x /= 2
        print(x)
    return x

def calculate_indiv_missingness(genotype):
    count_missing = 0
    for i in range(0, len(genotype), 2):
        combined = genotype[i]+genotype[i+1]
        if combined == '00':
            count_missing = count_missing + 1
    return count_missing/(len(genotype)/2)

我试图通过访问课堂上的讲座和搜索堆栈溢出来做到这一点，但我正在努力。