Дан список. Вывести сначала все отрицательные элементы, а затем все остальные

def reorganisation(list_of_numbers):
    return list(filter(lambda x: x < 0, list_of_numbers)) + \
           list(filter(lambda x: x == 0, list_of_numbers)) + \
           list(filter(lambda x: x > 0, list_of_numbers))
 
 
def solution():
    list_of_numbers = [-1, 2, 3, -5, -10, -100, 100, 1000, 0, 2000, 273492873984, -2938472987]  # лист чисел
    print(*reorganisation(list_of_numbers))
 
 
solution()

def reorganisation(list_of_numbers):
    return list(filter(lambda x: x < 0, list_of_numbers)) + \
           list(filter(lambda x: x >= 0, list_of_numbers))

print(*sorted(list_of_numbers))

print(*sorted(list_of_numbers, key=lambda x: x >= 0))

print(*sorted(list_of_numbers))

print(*sorted(list_of_numbers, key=lambda x: x >= 0))

def sorted(list_of_numbers):
    for i in range(len(list_of_numbers)):
 
        for j in range(i + 1, len(list_of_numbers)):
 
            if list_of_numbers[i] > list_of_numbers[j]:
                list_of_numbers[i], list_of_numbers[j] = list_of_numbers[j], list_of_numbers[i]
 
    return list_of_numbers
 
 
list_of_numbers = [-1, 2, 3, -5, -10, -100, 100, 1000, 0, 2000, 273492873984, -2938472987]
print(*sorted(list_of_numbers))

def bubble_sort(array):
    n = len(array)
    for i in range(n):
        already_sorted = True
        for j in range(n - i - 1):
            if array[j] > array[j + 1]:
                array[j], array[j + 1] = array[j + 1], array[j]
                already_sorted = False
        if already_sorted:
            break
    return array

def solution(list_):
    yield from filter(lambda x: x < 0, list_)
    yield from filter(lambda x: x >= 0, list_)
    
a = [-1, 2, 3, -5, -10, -100, 100, 1000, 0, 2000, 273492873984, -2938472987]
result = solution(a)
print(*result)