def bubble_sort(arr):
    arr = arr.copy()
    for i in range(len(arr)):
        swapped = False
        for j in range(len(arr) - i - 1):
            if arr[j] > arr[j + 1]:
                arr[j], arr[j + 1] = arr[j + 1], arr[j]
                swapped = True
        if not swapped:
            break
    return arr


def selection_sort(arr):
    arr = arr.copy()
    for i in range(len(arr)):
        min_index = i
        for j in range(i + 1, len(arr)):
            if arr[j] < arr[min_index]:
                min_index = j
        arr[i], arr[min_index] = arr[min_index], arr[i]
    return arr


def insertion_sort(arr):
    arr = arr.copy()
    for i in range(1, len(arr)):
        value = arr[i]
        j = i - 1
        while j >= 0 and arr[j] > value:
            arr[j + 1] = arr[j]
            j -= 1
        arr[j + 1] = value
    return arr


def merge_sort(arr):
    if len(arr) <= 1:
        return arr

    mid = len(arr) // 2
    left = merge_sort(arr[:mid])
    right = merge_sort(arr[mid:])
    merged = []
    i = j = 0

    while i < len(left) and j < len(right):
        if left[i] <= right[j]:
            merged.append(left[i])
            i += 1
        else:
            merged.append(right[j])
            j += 1

    return merged + left[i:] + right[j:]


def quick_sort(arr):
    if len(arr) <= 1:
        return arr

    pivot = arr[len(arr) // 2]
    left = [value for value in arr if value < pivot]
    middle = [value for value in arr if value == pivot]
    right = [value for value in arr if value > pivot]
    return quick_sort(left) + middle + quick_sort(right)


if __name__ == "__main__":
    data = [64, 34, 25, 12, 22, 11, 90]
    print(f"Original array: {data}")
    print(f"Bubble sort: {bubble_sort(data)}")
    print(f"Selection sort: {selection_sort(data)}")
    print(f"Insertion sort: {insertion_sort(data)}")
    print(f"Merge sort: {merge_sort(data)}")
    print(f"Quick sort: {quick_sort(data)}")
