Python 알고리즘_동명이인 찾기

# find_same_name_algorithm_1, 계산복잡도 : O(n)
def find_same_name1(n):
    for i in range(len(n) - 1):
        for j in range(i + 1, len(n)):
            if n[i] == n[j]:
                print(n[i])

# find_same_name_algorithm_2, 계산복잡도 : O(n)
def find_same_name2(n):
    result = set()
    for i in range(len(n) - 1):
        for j in range(i + 1, len(n)):
            if n[i] == n[j]:
                result.add(n[i])
    return result